Exponentially many monochromatic \(n\)-matchings in \(K_{3n-1}\) (Q1926046)

From MaRDI portal
Revision as of 05:15, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Exponentially many monochromatic \(n\)-matchings in \(K_{3n-1}\)
scientific article

    Statements

    Exponentially many monochromatic \(n\)-matchings in \(K_{3n-1}\) (English)
    0 references
    0 references
    0 references
    27 December 2012
    0 references
    2-edge-coloring
    0 references
    monochromatic subgraph
    0 references
    1-factor
    0 references

    Identifiers