On the domination number of a graph defined by containment

DOI10.2140/MOSCOW.2019.8.379MaRDI QIDQ2332798zbMATH OpenOpenAlexWikidataFDO

Authors 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

finite setshypergraphsTurá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)

Recommendations

• On the domination number of a graph
• On the domination number of some graphs
• On the domination number of some graphs
• On the domination number of a graph and its total graph
• On the total domination number of graphs
• BOUNDS ON THE DOMINATION NUMBER OF A GRAPH
• scientific article; zbMATH DE number 19197
• On f-domination number of a graph
• On the \(r\)-domination number of a graph
• Publication:4731223

Cites work

• scientific article; zbMATH DE number 3961650 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• Near perfect coverings in graphs and hypergraphs
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• The domination number of the graph defined by two levels of the \(n\)-cube

Cited in

(4)

• The domination number of the graph defined by two levels of the \(n\)-cube
• The domination number of the graph defined by two levels of the \(n\)-cube. II
• Dominating sets for uniform subset graphs
• Independent domination in the graph defined by two consecutive levels of the \(n\)-cube

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

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