Independence and chromatic densities of graphs

DOI10.4310/JOC.2011.V2.N3.A3zbMath1252.05102OpenAlexW2318782545MaRDI QIDQ446006

Anthony Bonato, Paweł Prałat, Jason I. Brown, Graeme Kemkes

Publication date: 28 August 2012

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

Full work available at URL: https://doi.org/10.4310/joc.2011.v2.n3.a3

zbMATH Keywords

graph colouringindependent setsgraph densityinfinite random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Infinite graphs (05C63) Density (toughness, etc.) (05C42)

Related Items (2)

Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs ⋮ Independence densities of hypergraphs

This page was built for publication: Independence and chromatic densities of graphs