Premium
An Extremal Property of Turán Graphs, II
Author(s) -
Tofts Spencer N.
Publication year - 2014
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.21739
Subject(s) - combinatorics , mathematics , partition (number theory) , vertex (graph theory) , graph , wheel graph , discrete mathematics , graph power , line graph
LetT 2 ( n )denote Turán's graph—the complete 2‐partite graph on n vertices with partition sizes as equal as possible. We show that for all n ≥ 4 , the graphT 2 ( n )has more proper vertex colorings in at most 4 colors than any other graph with the same number of vertices and edges.