scientific article; zbMATH DE number 7666858

MaRDI QIDQ5883642zbMATH OpenFDO

Authors Michael A. Henning, Nader Jafari Rad, Hailiza Kamarulhaili, Wen Chean Teh

Publication date 22 March 2023

Full work available at URL http://ajc.maths.uq.edu.au/pdf/85/ajc_v85_p350.pdf

zbMATH Keywords

probabilistic upper boundstotal domination number

Mathematics Subject Classification ID

Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Transversal (matching) theory (05D15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Recommendations

• A note on improved upper bounds on the transversal number of hypergraphs
• Total transversals in hypergraphs and their applications
• A Transition from Total Domination in Graphs to Transversals in Hypergraphs
• Total domination of graphs and small transversals of hypergraphs
• Transversals and domination in uniform hypergraphs

Cites work

• A note on improved upper bounds on the transversal number of hypergraphs
• A survey of selected recent results on total domination in graphs
• An upper bound for the transversal numbers of 4-uniform hypergraphs
• Covering all cliques of a graph
• Extremal uncrowded hypergraphs
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• Hypergraphs with large transversal number and with edge sizes at least 3
• Independence in 5-uniform hypergraphs
• Independent sets in hypergraphs
• Linear hypergraphs with large transversal number and maximum degree two
• Minimum size transversals in uniform hypergraphs
• On independent sets in hypergraphs
• Small transversals in hypergraphs
• Structures of domination in graphs
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Topics in Domination in Graphs
• Total domination in graphs
• Total domination of graphs and small transversals of hypergraphs
• Transversal numbers of uniform hypergraphs
• Transversals and independence in linear hypergraphs with maximum degree two
• Transversals and matchings in 3-uniform hypergraphs

Cited in

(12)

• Hypergraphs with large transversal number
• Bounds on upper transversals in hypergraphs
• Faster Algorithms to Enumerate Hypergraph Transversals
• Total transversal in graph
• Bounds on the game transversal number in hypergraphs
• Domination and total domination in hypergraphs
• Hypergraphs with large transversal number and with edge sizes at least 3
• A note on improved upper bounds on the transversal number of hypergraphs
• Total transversals in hypergraphs and their applications
• A Lower Bound for the HBC Transversal Hypergraph Generation
• Transversal coalitions in hypergraphs
• Total domination of graphs and small transversals of hypergraphs

This page was built for publication:

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