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

DOI10.1007/S00373-011-1051-0zbMath1256.05069OpenAlexW2027092218MaRDI QIDQ1926046

Han Ren, Ni Cao

Publication date: 27 December 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1051-0

zbMATH Keywords

1-factormonochromatic subgraph2-edge-coloring

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Lower bounds on the number of monochromatic matchings in \(K_{2s+t-1}\)

Cites Work

• Vertex coverings by monochromatic cycles and trees
• The Ramsey number for stripes

This page was built for publication: Exponentially many monochromatic \(n\)-matchings in \(K_{3n-1}\)