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

DOI10.1016/J.DAM.2019.02.006zbMath1464.05279OpenAlexW2917420686MaRDI QIDQ2026316

Leila Badakhshian, Zsolt Tuza

Publication date: 19 May 2021

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

Full work available at URL: https://doi.org/10.1016/j.dam.2019.02.006

zbMATH Keywords

domination numbertransversal designTurán theorem

Mathematics Subject Classification ID

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

Related Items (3)

On the domination number of $t$-constrained de Bruijn graphs ⋮ The domination number of the graph defined by two levels of the \(n\)-cube. II ⋮ On the domination number of a graph defined by containment

Cites Work

• Saturating Sperner families
• Maximal flat antichains of minimum weight
• The Difference Between Consecutive Primes, II
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The domination number of the graph defined by two levels of the \(n\)-cube