Monochromatic partitions in local edge colorings
From MaRDI portal
Publication:2220970
DOI10.1007/s10474-020-01054-1zbMath1474.05280OpenAlexW3039872424MaRDI QIDQ2220970
Publication date: 25 January 2021
Published in: Acta Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10474-020-01054-1
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Related Items (3)
Generalizations and strengthenings of Ryser's conjecture ⋮ Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Monochromatic square-cycle and square-path partitions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- Coverings by few monochromatic pieces: a transition between two Ramsey problems
- Partitioning random graphs into monochromatic components
- Partitioning 3-colored complete graphs into three monochromatic cycles
- Long monochromatic Berge cycles in colored 4-uniform hypergraphs
- Monochromatic matchings in the shadow graph of almost complete hypergraphs
- An improved bound for the monochromatic cycle partition number
- Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
- The Ramsey number of diamond-matchings and loose cycles in hypergraphs
- Stability of the path-path Ramsey number
- On generalized Ramsey numbers for trees
- Linear upper bounds for local Ramsey numbers
- Ramsey numbers for local colorings
- Local \(k\)-colorings of graphs and hypergraphs
- Partitioning by monochromatic trees
- Maximum degree and fractional matchings in uniform hypergraphs
- Vertex coverings by monochromatic cycles and trees
- Covering \(t\)-element sets by partitions
- Generalized local colorings of graphs
- A note on local colorings of graphs
- Small Ramsey numbers
- Local Ramsey numbers for some graphs
- Generalizing the Ramsey problem through diameter
- Three-color Ramsey numbers for paths
- Size of monochromatic components in local edge colorings
- Highly connected monochromatic subgraphs
- Local and meank-Ramsey numbers for complete graphs
- Tripartite Ramsey numbers for paths
- Monochromatic Cycle Partitions in Local Edge Colorings
- Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
- Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs
- Highly connected monochromatic subgraphs of multicolored graphs
- Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
- ON k-LOCAL AND k-MEAN COLORINGS OF GRAPHS AND HYPERGRAPHS
- Local colourings and monochromatic partitions in complete bipartite graphs
This page was built for publication: Monochromatic partitions in local edge colorings