The domination number of the graph defined by two levels of the \(n\)-cube. II

DOI10.1016/j.ejc.2020.103201zbMath1458.05187arXiv1910.10876OpenAlexW3049229033MaRDI QIDQ2225404

József Balogh, William Linz, Zsolt Tuza, Gyula O. H. Katona

Publication date: 8 February 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items

On the domination number of $t$-constrained de Bruijn graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Saturating Sperner families
• Maximal flat antichains of minimum weight
• 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