Edge disjoint monochromatic triangles in 2-colored graphs

DOI10.1016/S0012-365X(00)00312-5zbMath0983.05034OpenAlexW1988552935WikidataQ105529881 ScholiaQ105529881MaRDI QIDQ5937583

Michael S. Jacobson, Ralph J. Faudree, Jenő Lehel, Ronald J. Gould

Publication date: 21 April 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00312-5

zbMATH Keywords

2-coloringedge disjoint monochromatic complete graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (6)

Regarding two conjectures on clique and biclique partitions ⋮ On the number of edges not covered by monochromatic copies of a fixed graph. ⋮ Fork-forests in bi-colored complete bipartite graphs ⋮ On edges not in monochromatic copies of a fixed bipartite graph ⋮ Packing Cliques in Graphs with Independence Number 2 ⋮ Many disjoint triangles in co-triangle-free graphs

This page was built for publication: Edge disjoint monochromatic triangles in 2-colored graphs