A Combinatorial Classic — Sparse Graphs with High Chromatic Number

DOI10.1007/978-3-642-39286-3_15zbMath1293.05203OpenAlexW188337017MaRDI QIDQ5416086

Jaroslav Nešetřil

Publication date: 19 May 2014

Published in: Bolyai Society Mathematical Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39286-3_15

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Density (toughness, etc.) (05C42)

Related Items (11)

Phase transitions in discrete structures ⋮ On quasi-planar graphs: clique-width and logical description ⋮ 1-subdivisions, the fractional chromatic number and the Hall ratio ⋮ Statistics of orderings ⋮ Harnessing the Bethe free energy ⋮ Adding Edges to Increase the Chromatic Number of a Graph ⋮ Cycle reversions and dichromatic number in tournaments ⋮ Reducing the dichromatic number via cycle reversions in infinite digraphs ⋮ Circular coloring of random graphs: statistical physics investigation ⋮ On cylindrical graph construction and its applications ⋮ High girth hypergraphs with unavoidable monochromatic or rainbow edges

This page was built for publication: A Combinatorial Classic — Sparse Graphs with High Chromatic Number