Partitioning 2-edge-colored graphs by monochromatic paths and cycles
From MaRDI portal
Publication:484546
DOI10.1007/s00493-014-2935-4zbMath1340.05069arXiv1509.05544OpenAlexW2047807138MaRDI QIDQ484546
József Balogh, János Barát, Dániel Gerbner, András Gyárfás, Gábor N. Sárközy
Publication date: 7 January 2015
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.05544
Algebraic combinatorics (05E99) Coloring of graphs and hypergraphs (05C15) Triple systems (05B07) Ramsey theory (05D10)
Related Items (21)
Ramsey number of paths and connected matchings in Ore-type host graphs ⋮ Vertex covers by monochromatic pieces -- a survey of results and problems ⋮ Monochromatic cycle power partitions ⋮ Monochromatic cycle partitions of graphs with large minimum degree ⋮ Large monochromatic components in edge colored graphs with a minimum degree condition ⋮ Stability for vertex cycle covers ⋮ Vertex covering with monochromatic pieces of few colours ⋮ Improved monochromatic loose cycle partitions in hypergraphs ⋮ Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Minimum degree conditions for monochromatic cycle partitioning ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\) ⋮ Monochromatic bounded degree subgraph partitions ⋮ Shortcutting directed and undirected networks with a degree constraint ⋮ Partitioning random graphs into monochromatic components ⋮ Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles ⋮ Local colourings and monochromatic partitions in complete bipartite graphs ⋮ Monochromatic square-cycle and square-path partitions ⋮ Monochromatic cycle partitions in random graphs ⋮ Partitioning a graph into a cycle and a sparse graph ⋮ Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- Some Ramsey-Turán type problems and related questions
- Partitioning 3-colored complete graphs into three monochromatic cycles
- An improved bound for the monochromatic cycle partition number
- On 2-factors with \(k\) components
- Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
- Gallai colorings of non-complete graphs
- Vertex coverings by monochromatic cycles and trees
- Path-cycle Ramsey numbers
- \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
- Three-color Ramsey numbers for paths
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
- Monochromatic Cycles in 2-Coloured Graphs
- Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp
- Monochromatic cycle partitions of edge-colored graphs
- On maximal paths and circuits of graphs
- Tripartite Ramsey numbers for paths
- Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
- Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
- Gallai colorings and domination in multipartite digraphs
- Vertex coverings by monochromatic paths and cycles
- On a problem of K. Zarankiewicz
This page was built for publication: Partitioning 2-edge-colored graphs by monochromatic paths and cycles
