Maximizing the number of q -colorings

DOI10.1112/plms/pdp041zbMath1221.05152arXiv0811.2625OpenAlexW2148795954MaRDI QIDQ3059717

Po-Shen Loh, Oleg Pikhurko, Benjamin Sudakov

Publication date: 26 November 2010

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0811.2625

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (18)

Counting dominating sets and related structures in graphs ⋮ The Extremality of 2-Partite Turán Graphs with Respect to the Number of Colorings ⋮ A proof of Tomescu's graph coloring conjecture ⋮ Maximizing the number of \(x\)-colorings of 4-chromatic graphs ⋮ Maximizing proper colorings on graphs ⋮ Hypergraph Independent Sets ⋮ Counting proper colourings in 4-regular graphs via the Potts model ⋮ Extremal colorings and independent sets ⋮ An Extremal Property of Turán Graphs, II ⋮ Maximizing H‐Colorings of a Regular Graph ⋮ Extremal Graphs for Homomorphisms II ⋮ An analytic approach to stability ⋮ Extremal graphs for homomorphisms ⋮ The maximum number of colorings of graphs of given order and size: a survey ⋮ Maximum number of colourings: 4-chromatic graphs ⋮ Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs ⋮ Extremal H‐Colorings of Graphs with Fixed Minimum Degree ⋮ Counting colorings of a regular graph

This page was built for publication: Maximizing the number of q -colorings