𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge disjoint monochromatic triangles in 2-colored graphs

✍ Scribed by P. Erdős; R.J. Faudree; R.J. Gould; M.S. Jacobson; J. Lehel


Book ID
108315565
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
81 KB
Volume
231
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Monochromatic cycle partitions of edge-c
✍ Gábor N. Sárközy 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB 👁 1 views

In this article we study the monochromatic cycle partition problem for non-complete graphs. We consider graphs with a given independence number (G) = . Generalizing a classical conjecture of Erd" os, Gyárfás and Pyber, we conjecture that if we r-color the edges of a graph G with (G) = , then the ver