On the domination number of a graph defined by containment

DOI10.2140/MOSCOW.2019.8.379zbMath1426.05130OpenAlexW2980106885WikidataQ127090482 ScholiaQ127090482MaRDI QIDQ2332798

Peter Frankl

Publication date: 5 November 2019

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/moscow.2019.8.379

zbMATH Keywords

hypergraphsfinite setsTurán's theorem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Near perfect coverings in graphs and hypergraphs
• The domination number of the graph defined by two levels of the \(n\)-cube

This page was built for publication: On the domination number of a graph defined by containment