𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Partitioning edge-coloured complete graphs into monochromatic cycles

✍ Scribed by Pokrovskiy, Alexey

Book ID
122029363
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
279 KB
Volume
43
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Partitioning Complete Bipartite Graphs b
Partitioning Complete Bipartite Graphs by Monochromatic Cycles
✍ P.E. Haxell πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 886 KB

For every positive integer r there exists a constant C r depending only on r such that for every colouring of the edges of the complete bipartite graph K n, n with r colours, there exists a set of at most C r monochromatic cycles whose vertex sets partition the vertex set of K n, n . This answers a

Monochromatic cycle partitions of edge-c
Monochromatic cycle partitions of edge-colored graphs
✍ 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