Bounds on upper transversals in hypergraphs

Michael A. Henning*, Anders Yeo

*Corresponding author for this work

Research output: Contribution to journalJournal articleResearchpeer-review

Abstract

A set S of vertices in a hypergraph H is a transversal if it has a nonempty intersection with every edge of H. For k≥ 1 , if H is a hypergraph with every edge of size at least k, then a k-transversal in H is a transversal that intersects every edge of H in at least k vertices. In particular, a 1-transversal is a transversal. The upper k-transversal number Υ k(H) of H is the maximum cardinality of a minimal k-transversal in H. Let H be a hypergraph with nH vertices and mH edges. We show that for r≥ 2 and for every integer k∈ [r] , if H is r-uniform with maximum degree Δ , then Υk(H)≤(k·Δk(Δ-1)+r)nH and Υk(H)≤(k·ΔΔ(k+1)+r-k)(nH+mH), and both bounds are tight. As a special case of this result, if H is a 3-regular, 3-uniform hypergraph, then Υ2(H)≤67nH, and equality in this bound is achieved by the Fano plane. We also discuss a relation between upper transversals in 3-uniform hypergraphs and the famous cap set problem, and show that for every given ϵ> 0 , there exists a 3-uniform, connected, linear hypergraphs of sufficiently large order such that Υ1(H)<ϵ·nH.

Original languageEnglish
JournalJournal of Combinatorial Optimization
Volume39
Pages (from-to)77-89
ISSN1382-6905
DOIs
Publication statusPublished - 2020

Keywords

  • k-transversal number
  • Transversal
  • Upper transversal

Fingerprint

Dive into the research topics of 'Bounds on upper transversals in hypergraphs'. Together they form a unique fingerprint.

Cite this