Bounded monochromatic components for random graphs

DOI10.4310/JOC.2018.v9.n3.a1zbMath1387.05190arXiv1407.3555MaRDI QIDQ1750660

Nicolas Broutin, Ross J. Kang

Publication date: 23 May 2018

Published in: Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

random graphsgraph colouringcomponent colouringcomponent stability

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Distance \(r\)-domination number and \(r\)-independence complexes of graphs ⋮ Clustered colouring of graph classes with bounded treedepth or pathwidth ⋮ Higher Independence Complexes of graphs and their homotopy types ⋮ On the \(k\)-component independence number of a tree

This page was built for publication: Bounded monochromatic components for random graphs