Improving our earlier result we show that for every integer k≥1 there exists a c(k) such that in every 2-colored complete graph apart from at most c(k) vertices the vertex set can be covered by 200k2logk vertex disjoint monochromatic kth powers of cycles. © 2016 Elsevier B.V
In this paper we prove a new result about partitioning coloured complete graphs and use it to deter...
© 2018 Wiley Periodicals, Inc. We show that any complete k-partite graph G on n vertices, with k≥3, ...
In this paper we prove a new result about partitioning coloured complete graphs and use it to determ...
AbstractImproving a result of Erdős, Gyárfás and Pyber for large n we show that for every integer r⩾...
Abstract Let F = {F1,F2,...} be a sequence of graphs such that Fn is a graph on n vertices with maxi...
AbstractIf the edges of a finite complete graph K are colored with r colors then the vertex set of K...
AbstractIn a landmark paper, Erdős et al. (1991) [3] proved that if G is a complete graph whose edge...
A conjecture of Erdős, Gyárfás, and Pyber says that in any edge-colouring of a complete graph with r...
In this article we study the monochromatic cycle partition problem for non-complete graphs. We consi...
Doctor en Ciencias de la Ingeniería, Mención Modelación MatemáticaThe first part of this thesis conc...
Confirming a conjecture of Gy´arf´as, we prove that, for all natural numbers k and r, the vertices ...
AbstractAnyr-edge-colouredn-vertex complete graphKncontains at mostrmonochromatic trees, all of diff...
Confirming a conjecture of Gyárfás, we prove that, for all natural numbers k and r, the vertices of ...
An edge coloring of a graph is said to be an r‐local coloring if the edges incident to any vertex ar...
AbstractGeneralizing a result of Erdős, Gyárfás and Pyber we show that there exists a consta...
In this paper we prove a new result about partitioning coloured complete graphs and use it to deter...
© 2018 Wiley Periodicals, Inc. We show that any complete k-partite graph G on n vertices, with k≥3, ...
In this paper we prove a new result about partitioning coloured complete graphs and use it to determ...
AbstractImproving a result of Erdős, Gyárfás and Pyber for large n we show that for every integer r⩾...
Abstract Let F = {F1,F2,...} be a sequence of graphs such that Fn is a graph on n vertices with maxi...
AbstractIf the edges of a finite complete graph K are colored with r colors then the vertex set of K...
AbstractIn a landmark paper, Erdős et al. (1991) [3] proved that if G is a complete graph whose edge...
A conjecture of Erdős, Gyárfás, and Pyber says that in any edge-colouring of a complete graph with r...
In this article we study the monochromatic cycle partition problem for non-complete graphs. We consi...
Doctor en Ciencias de la Ingeniería, Mención Modelación MatemáticaThe first part of this thesis conc...
Confirming a conjecture of Gy´arf´as, we prove that, for all natural numbers k and r, the vertices ...
AbstractAnyr-edge-colouredn-vertex complete graphKncontains at mostrmonochromatic trees, all of diff...
Confirming a conjecture of Gyárfás, we prove that, for all natural numbers k and r, the vertices of ...
An edge coloring of a graph is said to be an r‐local coloring if the edges incident to any vertex ar...
AbstractGeneralizing a result of Erdős, Gyárfás and Pyber we show that there exists a consta...
In this paper we prove a new result about partitioning coloured complete graphs and use it to deter...
© 2018 Wiley Periodicals, Inc. We show that any complete k-partite graph G on n vertices, with k≥3, ...
In this paper we prove a new result about partitioning coloured complete graphs and use it to determ...
DOI
Add to ORKG