Exponentially many monochromatic n-matchings in K₃n-1

DOI10.1007/S00373-011-1051-0MaRDI QIDQ1926046zbMATH OpenOpenAlexFDO

Authors Ni Cao, Han Ren

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-factor2-edge-coloringmonochromatic subgraph

Mathematics Subject Classification ID

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

Recommendations

• Lower bounds on the number of monochromatic matchings in \(K_{2s+t-1}\)
• On 3-colorings of \(E(K_ n)\)
• Generalizations of some Ramsey-type theorems for matchings
• Coverings by few monochromatic pieces: a transition between two Ramsey problems
• Edge disjoint monochromatic triangles in 2-colored graphs

Cites work

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

Cited in

(1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1926046)