Hypergraphs with large transversal number and with edge sizes at least four

DOI10.2478/S11533-012-0023-9MaRDI QIDQ424115zbMATH OpenOpenAlexFDO

Authors Michael A. Henning, Christian Löwenstein

Publication date 31 May 2012

Published in Central European Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.2478/s11533-012-0023-9

zbMATH Keywords

transversal4-uniform hypergraph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hypergraphs (05C65)

Recommendations

• Hypergraphs with large transversal number
• 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
• Transversals in 4-uniform hypergraphs
• Linear hypergraphs with large transversal number and maximum degree two

Cites work

• An upper bound for the transversal numbers of 4-uniform hypergraphs
• Covering all cliques of a graph
• Hypergraphs with large transversal number and with edge sizes at least 3
• Small transversals in hypergraphs
• Total domination of graphs and small transversals of hypergraphs

Cited in

(21)

• Transversal game on hypergraphs and the \(\frac{3}{4}\)-conjecture on the total domination game
• A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size
• A characterization of hypergraphs with large domination number
• On the transversal number of \(k\)-uniform connected hypergraphs
• Domination in intersecting hypergraphs
• Extremal hypergraphs for matching number and domination number
• The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four
• Hypergraph families with bounded edge cover or transversal number
• A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
• An upper bound for the transversal number of connected \(k\)-uniform hypergraphs
• Bounds on the game transversal number in hypergraphs
• Domination and total domination in hypergraphs
• Total transversals and total domination in uniform hypergraphs
• On the transversal number of rank \(k\) hypergraphs
• Domination and matching in power and generalized power hypergraphs
• Matching criticality in intersecting hypergraphs
• Domination game on uniform hypergraphs
• Transversals in 4-uniform hypergraphs
• Hypergraphs with large transversal number
• Total transversals in hypergraphs and their applications
• Hypergraphs with large transversal number and with edge sizes at least 3

This page was built for publication: Hypergraphs with large transversal number and with edge sizes at least four

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q424115)