Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
From MaRDI portal
Publication:4238172
DOI10.1017/S0963548398003599zbMath0916.05025OpenAlexW2170028807MaRDI QIDQ4238172
Tomasz Łuczak, Endre Szemerédi, Vojtěch Rödl
Publication date: 7 July 1999
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548398003599
Related Items
Vertex covers by monochromatic pieces -- a survey of results and problems, Monochromatic cycle power partitions, Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles, Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles, Monochromatic Cycle Partitions in Local Edge Colorings, An improved bound for the monochromatic cycle partition number, Monochromatic cycle partitions of graphs with large minimum degree, Vertex covering with monochromatic pieces of few colours, Partitioning infinite hypergraphs into few monochromatic Berge-paths, Cover \(k\)-uniform hypergraphs by monochromatic loose paths, Improved monochromatic loose cycle partitions in hypergraphs, Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles, Partitioning edge-coloured complete graphs into monochromatic cycles and paths, Monochromatic loose-cycle partitions in hypergraphs, Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles, Heterochromatic tree partition problem in complete tripartite graphs, Monochromatic paths in 2-edge-coloured graphs and hypergraphs, Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs, Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles, Monochromatic partitions in local edge colorings, Minimum degree conditions for monochromatic cycle partitioning, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Heterochromatic tree partition numbers for complete bipartite graphs, Partitioning 2-edge-colored graphs by monochromatic paths and cycles, Coverings by few monochromatic pieces: a transition between two Ramsey problems, Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\), Monochromatic bounded degree subgraph partitions, Partitioning random graphs into monochromatic components, Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles, Heterochromatic tree partition number in complete multipartite graphs, Partitioning complete graphs by heterochromatic trees, An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs, Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture, Unnamed Item, Monochromatic cycle partitions of edge-colored graphs, Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles, Local colourings and monochromatic partitions in complete bipartite graphs, Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey, Monochromatic square-cycle and square-path partitions, Vertex partitions by connected monochromatic \(k\)-regular graphs, Monochromatic cycle partitions in random graphs, Partitioning a graph into a cycle and a sparse graph, Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles, Towards Lehel's conjecture for 4-uniform tight cycles, Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles
