The chromatic gap and its extremes
Combinatorics
2020-12-01 v1
Abstract
The {\em chromatic gap} is the difference between the chromatic number and the clique number of a graph. Here we investigate , the maximum chromatic gap over graphs on vertices. Can the extremal graphs be explored? While computational problems related to the chromatic gap are hopeless, an interplay between Ramsey theory and matching theory leads to a simple and (almost) exact formula for in terms of Ramsey numbers.
Cite
@article{arxiv.1108.3444,
title = {The chromatic gap and its extremes},
author = {András Gyárfás and András Sebõ and Nicolas Trotignon},
journal= {arXiv preprint arXiv:1108.3444},
year = {2020}
}
Comments
41 pages; Cahiers Leibniz No 184, https://consult-cahiersleibniz.g-scop.grenoble-inp.fr/apps/WebObjects/CahiersLeibniz/