The domination number of the graph defined by two levels of the \(n\)-cube (Q2026316): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Difference Between Consecutive Primes, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saturating Sperner families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal flat antichains of minimum weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3669452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4175585 / rank
 
Normal rank

Revision as of 18:54, 25 July 2024

scientific article
Language Label Description Also known as
English
The domination number of the graph defined by two levels of the \(n\)-cube
scientific article

    Statements

    The domination number of the graph defined by two levels of the \(n\)-cube (English)
    0 references
    0 references
    0 references
    0 references
    19 May 2021
    0 references
    domination number
    0 references
    Turán theorem
    0 references
    transversal design
    0 references

    Identifiers