Turán Graphs and the Number of Colorings

DOI10.1137/100799745zbMath1228.05158OpenAlexW1986086795MaRDI QIDQ3094910

Serguei Norine

Publication date: 27 October 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/100799745

zbMATH Keywords

chromatic polynomialTurán graphnumber of colorings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength ⋮ The Extremality of 2-Partite Turán Graphs with Respect to the Number of Colorings ⋮ A proof of Tomescu's graph coloring conjecture ⋮ Maximizing proper colorings on graphs ⋮ An Extremal Property of Turán Graphs, II ⋮ The maximum number of colorings of graphs of given order and size: a survey

This page was built for publication: Turán Graphs and the Number of Colorings