Partitioning random graphs into monochromatic components
From MaRDI portal
Publication:510329
zbMath1355.05192arXiv1509.09168MaRDI QIDQ510329
Publication date: 17 February 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.09168
Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (12)
Generalizations and strengthenings of Ryser's conjecture ⋮ Large monochromatic components and long monochromatic cycles in random hypergraphs ⋮ Large monochromatic components in edge colored graphs with a minimum degree condition ⋮ Vertex covering with monochromatic pieces of few colours ⋮ Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Covering random graphs with monochromatic trees ⋮ Monochromatic trees in random graphs ⋮ Large monochromatic components in colorings of complete hypergraphs ⋮ Monochromatic partitions in local edge colorings ⋮ Covering graphs by monochromatic trees and Helly-type results for hypergraphs ⋮ Monochromatic cycle partitions in random graphs ⋮ Covering 3-Edge-Colored Random Graphs with Monochromatic Trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monochromatic cycle partitions of graphs with large minimum degree
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- Some Ramsey-Turán type problems and related questions
- Partition of graphs and hypergraphs into monochromatic connected parts
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles
- An improved bound for the monochromatic cycle partition number
- Ryser's conjecture for tripartite 3-graphs
- Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
- Partitioning by monochromatic trees
- Maximum degree and fractional matchings in uniform hypergraphs
- Vertex coverings by monochromatic cycles and trees
- Monochromatic trees in random graphs
- Generalizing the Ramsey problem through diameter
- Decompositions of edge-colored infinite complete graphs into monochromatic paths
- Introduction to Random Graphs
- Calculating Ramsey Numbers by Partitioning Colored Graphs
- Szemerédi's Regularity Lemma for Matrices and Sparse Graphs
- Large Monochromatic Components in Edge Colorings of Graphs: A Survey
- Ramsey games with giants
- Local connectivity of a random graph
- Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
- Highly connected monochromatic subgraphs of multicolored graphs
- Monochromatic Paths in Graphs
- Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
- Szemerédi’s Regularity Lemma for Sparse Graphs
- Combinatorial theorems relative to a random set
- Threshold Functions for Ramsey Properties
- Path Ramsey Number for Random Graphs
- Coloring the edges of a random graph without a monochromatic giant component
This page was built for publication: Partitioning random graphs into monochromatic components
