The Tuza–Vestergaard Theorem

DOI10.1137/22m1475508zbMath1517.05175OpenAlexW4381616995WikidataQ123012554 ScholiaQ123012554MaRDI QIDQ6161262

Michael A. Henning, Anders Yeo, Christian Löwenstein

Publication date: 27 June 2023

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

Full work available at URL: https://doi.org/10.1137/22m1475508

zbMATH Keywords

transversal number6-uniform hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Enumeration in graph theory (05C30) Transversal (matching) theory (05D15)

Related Items (2)

Transversals in regular uniform hypergraphs ⋮ Transversals in 4-uniform hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum size transversals in uniform hypergraphs
• A new lower bound on the independence number of a graph and applications
• Matchings and transversals in hypergraphs, domination and independence in trees
• Transversals and domination in uniform hypergraphs
• Transversals in 4-uniform hypergraphs
• Independence in 5-uniform hypergraphs
• Total domination of graphs and small transversals of hypergraphs
• Covering all cliques of a graph
• Small transversals in hypergraphs
• On the game total domination number
• An upper bound for the transversal numbers of 4-uniform hypergraphs
• Transversals in uniform hypergraphs with property \((p,2)\)
• Heavy transversals and indecomposable hypergraphs
• Small transversals in uniform hypergraphs
• Hypergraphs with large transversal number
• Transversals in linear uniform hypergraphs
• A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
• Hypergraphs with large transversal number and with edge sizes at least 3
• Domination in partitioned graphs

This page was built for publication: The Tuza–Vestergaard Theorem