AbstractImproving a result of Erdős, Gyárfás and Pyber for large n we show that for every integer r⩾2 there exists a constant n0=n0(r) such that if n⩾n0 and the edges of the complete graph Kn are colored with r colors then the vertex set of Kn can be partitioned into at most 100rlogr vertex disjoint monochromatic cycles
Confirming a conjecture of Gyárfás, we prove that, for all natural numbers k and r, the vertices of ...
Balogh, Barát, Gerbner, Gyárfás, and Sárközy made the following conjecture. Let G be a graph on ...
A conjecture of Erdös, Gyárfás, and Pyber says that in any edge-colouring of a complete graph with r...
AbstractImproving a result of Erdős, Gyárfás and Pyber for large n we show that for every integer r⩾...
Improving our earlier result we show that for every integer k≥1 there exists a c(k) such that in eve...
AbstractAnyr-edge-colouredn-vertex complete graphKncontains at mostrmonochromatic trees, all of diff...
AbstractGeneralizing a result of Erdős, Gyárfás and Pyber we show that there exists a consta...
AbstractIn a landmark paper, Erdős et al. (1991) [3] proved that if G is a complete graph whose edge...
In this article we study the monochromatic cycle partition problem for non-complete graphs. We consi...
Abstract Let F = {F1,F2,...} be a sequence of graphs such that Fn is a graph on n vertices with maxi...
In 1989, Gyárfás conjectured that, for every natural r, r monochromatic paths are suficient to verte...
A conjecture of Erdős, Gyárfás, and Pyber says that in any edge-colouring of a complete graph with r...
AbstractIf the edges of a finite complete graph K are colored with r colors then the vertex set of K...
An edge coloring of a graph is said to be an r‐local coloring if the edges incident to any vertex ar...
Confirming a conjecture of Gy´arf´as, we prove that, for all natural numbers k and r, the vertices ...
Confirming a conjecture of Gyárfás, we prove that, for all natural numbers k and r, the vertices of ...
Balogh, Barát, Gerbner, Gyárfás, and Sárközy made the following conjecture. Let G be a graph on ...
A conjecture of Erdös, Gyárfás, and Pyber says that in any edge-colouring of a complete graph with r...
AbstractImproving a result of Erdős, Gyárfás and Pyber for large n we show that for every integer r⩾...
Improving our earlier result we show that for every integer k≥1 there exists a c(k) such that in eve...
AbstractAnyr-edge-colouredn-vertex complete graphKncontains at mostrmonochromatic trees, all of diff...
AbstractGeneralizing a result of Erdős, Gyárfás and Pyber we show that there exists a consta...
AbstractIn a landmark paper, Erdős et al. (1991) [3] proved that if G is a complete graph whose edge...
In this article we study the monochromatic cycle partition problem for non-complete graphs. We consi...
Abstract Let F = {F1,F2,...} be a sequence of graphs such that Fn is a graph on n vertices with maxi...
In 1989, Gyárfás conjectured that, for every natural r, r monochromatic paths are suficient to verte...
A conjecture of Erdős, Gyárfás, and Pyber says that in any edge-colouring of a complete graph with r...
AbstractIf the edges of a finite complete graph K are colored with r colors then the vertex set of K...
An edge coloring of a graph is said to be an r‐local coloring if the edges incident to any vertex ar...
Confirming a conjecture of Gy´arf´as, we prove that, for all natural numbers k and r, the vertices ...
Confirming a conjecture of Gyárfás, we prove that, for all natural numbers k and r, the vertices of ...
Balogh, Barát, Gerbner, Gyárfás, and Sárközy made the following conjecture. Let G be a graph on ...
A conjecture of Erdös, Gyárfás, and Pyber says that in any edge-colouring of a complete graph with r...
DOI
Add to ORKG