The minimum number of vertices in uniform hypergraphs with given domination number

DOI10.1016/j.disc.2016.07.007zbMath1369.05154arXiv1603.03557OpenAlexW2295887539WikidataQ59072368 ScholiaQ59072368MaRDI QIDQ2401806

Máté Vizer, Balázs Patkós, Zsolt Tuza, Csilla Bujtás

Publication date: 5 September 2017

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

Full work available at URL: https://arxiv.org/abs/1603.03557

zbMATH Keywords

hypergraphdomination numberextremal problemdistance dominationmultiple domination

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Domination game on uniform hypergraphs ⋮ Finding a non-minority ball with majority answers ⋮ Domination and Total Domination in Hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding a majority ball with majority answers
• Total transversals and total domination in uniform hypergraphs
• Hypergraphs with large domination number and with edge sizes at least three
• Transversals and domination in uniform hypergraphs
• Critical hypergraphs and interesting set-pair systems
• Inequalities for two set systems with prescribed intersections
• Relations between packing and covering numbers of a tree
• Nordhaus-Gaddum inequalities for domination in graphs
• On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method
• Distance domination in graphs with given minimum and maximum degree
• Equality of domination and transversal numbers in hypergraphs
• Domination in hypergraphs
• Hypergraph domination and strong independence
• Lower Bounds on the Distance Domination Number of a Graph

This page was built for publication: The minimum number of vertices in uniform hypergraphs with given domination number