Monochromatic cycle covers in random graphs

DOI10.1002/rsa.20819zbMath1405.05163arXiv1712.03145OpenAlexW2771416324MaRDI QIDQ4625023

Rajko Nenadov, Dániel Korándi, Frank Mousset, Nemanja Škorić, Benjamin Sudakov

Publication date: 20 February 2019

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.03145

zbMATH Keywords

random graphscycle covermonochromatic cycles

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles, Covering random graphs with monochromatic trees, Minimum degree conditions for monochromatic cycle partitioning, 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