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

DOI10.1007/S00373-017-1829-9zbMath1378.05066OpenAlexW2735005752MaRDI QIDQ1684931

Ni Cao, Han Ren, Weihua Lu, Fugang Chao

Publication date: 12 December 2017

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

Full work available at URL: https://doi.org/10.1007/s00373-017-1829-9

zbMATH Keywords

edge-coloringmonochromatic matchings

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremality of degree-based graph entropies
• Vertex coverings by monochromatic cycles and trees
• Exponentially many monochromatic \(n\)-matchings in \(K_{3n-1}\)
• On a conjecture about tricyclic graphs with maximal energy
• The Ramsey number for stripes

This page was built for publication: Lower bounds on the number of monochromatic matchings in \(K_{2s+t-1}\)