An improved bound for the monochromatic cycle partition number

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

On maximal paths and circuits of graphs
Title not available (Why is that?)
$R(C_n,C_n,C_n)\leqq (4+o(1))n$
Title not available (Why is that?)
Title not available (Why is that?)
Blow-up lemma
Vertex coverings by monochromatic cycles and trees
Partitioning complete bipartite graphs by monochromatic cycles
Title not available (Why is that?)
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
Vertex partitions by connected monochromatic $k$-regular graphs
An algorithmic version of the blow-up lemma
Quadripartite version of the Hajnal-Szemerédi theorem
Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte

Cited In (48)

Ramsey number of paths and connected matchings in Ore-type host graphs
Heterochromatic tree partition problem in complete tripartite graphs
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Towards Lehel's conjecture for 4-uniform tight cycles
Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles
Partitioning 2-edge-colored graphs by monochromatic paths and cycles
Minimum degree conditions for monochromatic cycle partitioning
An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs
Partitioning complete graphs by heterochromatic trees
Vertex covers by monochromatic pieces -- a survey of results and problems
Partitioning 3-coloured complete graphs into three monochromatic paths
Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
Monochromatic cycle partitions of graphs with large minimum degree
Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
Improved monochromatic loose cycle partitions in hypergraphs
Partitioning edge-coloured complete graphs into monochromatic cycles and paths
Matchings with few colors in colored complete graphs and hypergraphs
Monochromatic loose-cycle partitions in hypergraphs
Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles
Monochromatic bounded degree subgraph partitions
Monochromatic cycle partitions of $2$-coloured graphs with minimum degree $3n/4$
Local colourings and monochromatic partitions in complete bipartite graphs
Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles
A note on the saturation number of the family of $k$-connected graphs
Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
Partitioning a 2-edge-coloured graph of minimum degree $2n/3 + o(n)$ into three monochromatic cycles
Heterochromatic tree partition number in complete multipartite graphs
Tiling edge-coloured graphs with few monochromatic bounded-degree graphs
Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles
Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
Local colourings and monochromatic partitions in complete bipartite graphs
Vertex covering with monochromatic pieces of few colours
Decompositions of edge-coloured infinite complete graphs into monochromatic paths. II
Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles
Partitioning infinite hypergraphs into few monochromatic Berge-paths
Vertex partitions of non-complete graphs into connected monochromatic $k$-regular graphs
Monochromatic square-cycle and square-path partitions
Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles
Monochromatic partitions in local edge colorings
Covering graphs by monochromatic trees and Helly-type results for hypergraphs
Monochromatic cycle power partitions
Partitioning random graphs into monochromatic components
Problems close to my heart
Monochromatic Cycle Partitions in Local Edge Colorings
Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
Monochromatic cycle partitions in random graphs
Ramsey number of a connected triangle matching
The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle

   Recommendations

Partitioning complete bipartite graphs by monochromatic cycles 👍 👎
Monochromatic cycle partitions in random graphs 👍 👎
Minimum degree conditions for monochromatic cycle partitioning 👍 👎
Improved monochromatic loose cycle partitions in hypergraphs 👍 👎
Vertex coverings by monochromatic cycles and trees 👍 👎

This page was built for publication: An improved bound for the monochromatic cycle partition number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q859613)