A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
From MaRDI portal
Publication:2439129
DOI10.1016/j.disc.2014.01.014zbMath1283.05193arXiv1401.4851OpenAlexW1981965088MaRDI QIDQ2439129
Michael A. Henning, Christian Löwenstein
Publication date: 7 March 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.4851
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15)
Related Items
A characterization of hypergraphs with large domination number ⋮ Transversals and independence in linear hypergraphs with maximum degree two ⋮ On upper transversals in 3-uniform hypergraphs ⋮ Bounds on the game transversal number in hypergraphs ⋮ Upper transversals in hypergraphs ⋮ Transversals in regular uniform hypergraphs ⋮ The Tuza–Vestergaard Theorem ⋮ A note on fractional disjoint transversals in hypergraphs ⋮ Bounds on upper transversals in hypergraphs ⋮ Affine planes and transversals in 3-uniform linear hypergraphs ⋮ Domination and Total Domination in Hypergraphs ⋮ Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game ⋮ The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3
Cites Work
- Hypergraphs with large transversal number and with edge sizes at least four
- Total domination of graphs and small transversals of hypergraphs
- Covering all cliques of a graph
- Small transversals in hypergraphs
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Hypergraphs with large transversal number
- Strong Transversals in Hypergraphs and Double Total Domination in Graphs
- Hypergraphs with large transversal number and with edge sizes at least 3
- A Theorem on Coloring the Lines of a Network
This page was built for publication: A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem