Independence and chromatic densities of graphs

DOI10.4310/JOC.2011.V2.N3.A3zbMATH Open1252.05102OpenAlexW2318782545MaRDI QIDQ446006FDOQ446006

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

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

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)

Cited In (7)

• Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs
• Independence densities of hypergraphs
• Title not available (Why is that?)
• Independence number and packing coloring of generalized Mycielski graphs
• On the abstract chromatic number and its computability for finitely axiomatizable theories
• On the order of countable graphs
• Independent sets, cliques, and colorings in graphons

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)