Independence and chromatic densities of graphs

DOI10.4310/JOC.2011.V2.N3.A3MaRDI QIDQ446006zbMATHOpenAlexFDO

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

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 densitygraph colouringindependent setsinfinite random graph

Mathematics Subject Classification ID

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

Recommendations

• Independence densities of hypergraphs
• Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs
• On the ultimate independence ratio of a graph
• Independence numbers and chromatic numbers of some distance graphs
• Density of monochromatic infinite subgraphs

Cited in

(7)

• On the abstract chromatic number and its computability for finitely axiomatizable theories
• Independence number and packing coloring of generalized Mycielski graphs
• Independent sets, cliques, and colorings in graphons
• Independence densities of hypergraphs
• Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs
• scientific article; zbMATH DE number 6383843 (Why is no real title available?)
• On the order of countable graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q446006)