Maximum number of colorings of (2k, k2)‐graphs

DOI10.1002/jgt.20254zbMath1132.05022OpenAlexW4214710863MaRDI QIDQ5434250

Andrew J. Woldar, Felix Lazebnik, Oleg Pikhurko

Publication date: 4 January 2008

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20254

zbMATH Keywords

chromatic polynomialTurán graphextremal graphmaximum number of colourings

Mathematics Subject Classification ID

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

Related Items (7)

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 ⋮ An analytic approach to stability ⋮ The maximum number of colorings of graphs of given order and size: a survey ⋮ Maximum number of colourings: 4-chromatic graphs

Cites Work

• Unnamed Item

This page was built for publication: Maximum number of colorings of (2k, k²)‐graphs