Minimum size transversals in uniform hypergraphs

DOI10.1016/j.disc.2013.08.022zbMath1280.05096OpenAlexW2052275226MaRDI QIDQ394227

Karolina Warno, Zbigniew Lonc

Publication date: 24 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.08.022

zbMATH Keywords

uniform hypergraphTurán-type problemsminimum-sized transversaltransversal number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Transversal (matching) theory (05D15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

On upper transversals in 3-uniform hypergraphs, Bounds on the game transversal number in hypergraphs, Upper transversals in hypergraphs, Independence in 5-uniform hypergraphs, Transversals in regular uniform hypergraphs, The Tuza–Vestergaard Theorem, Unnamed Item, A note on improved upper bounds on the transversal number of hypergraphs, Lower bounds on Tuza constants for transversals in linear uniform hypergraphs, Bounds on upper transversals in hypergraphs, Affine planes and transversals in 3-uniform linear hypergraphs, Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game

Cites Work

• Transversals and domination in uniform hypergraphs
• Total domination of graphs and small transversals of hypergraphs
• A survey of selected recent results on total domination in graphs
• Covering all cliques of a graph
• Small transversals in hypergraphs
• An upper bound for the transversal numbers of 4-uniform hypergraphs
• Transversal numbers of uniform hypergraphs
• Unnamed Item