5 research outputs found
Occupancy fraction, fractional colouring, and triangle fraction
Given , there exists such that, if , then for any graph on vertices of maximum degree
in which the neighbourhood of every vertex in spans at most
edges, (i) an independent set of drawn uniformly at random has at least
vertices in expectation, and (ii) the
fractional chromatic number of is at most .
These bounds cannot in general be improved by more than a factor
asymptotically. One may view these as stronger versions of results of Ajtai,
Koml\'os and Szemer\'edi (1981) and Shearer (1983). The proofs use a tight
analysis of the hard-core model.Comment: 10 page
The χ-Ramsey problem for triangle-free graphs
In 1967, Erdős asked for the greatest chromatic number, f(n), amongst all n-vertex, triangle-free graphs. An observation of Erdős and Hajnal together with Shearer's classical upper bound for the off-diagonal Ramsey number R(3,t) shows that f(n) is at most (2√2+o(1))√n/logn. We improve this bound by a factor √2, as well as obtaining an analogous bound on the list chromatic number which is tight up to a constant factor. A bound in terms of the number of edges that is similarly tight follows, and these results confirm a conjecture of Cames van Batenburg, de Joannis de Verclos, Kang, and Pirot
An improved procedure for colouring graphs of bounded local density
We develop an improved bound for the chromatic number of graphs of maximum
degree under the assumption that the number of edges spanning any
neighbourhood is at most for some fixed
. The leading term in this bound is best possible as .
As two consequences, we advance the state of the art in two longstanding and
well-studied graph colouring conjectures, the Erd\H{o}s-Ne\v{s}et\v{r}il
conjecture and Reed's conjecture. We prove that the strong chromatic index is
at most for any graph with sufficiently large maximum
degree . We prove that the chromatic number is at most for any graph with clique number
and sufficiently large maximum degree .Comment: 21 page
An algorithmic framework for colouring locally sparse graphs
We develop an algorithmic framework for graph colouring that reduces the
problem to verifying a local probabilistic property of the independent sets.
With this we give, for any fixed and , a randomised
polynomial-time algorithm for colouring graphs of maximum degree in
which each vertex is contained in at most copies of a cycle of length ,
where ,
with colours.
This generalises and improves upon several notable results including those of
Kim (1995) and Alon, Krivelevich and Sudakov (1999), and more recent ones of
Molloy (2019) and Achlioptas, Iliopoulos and Sinclair (2019). This bound on the
chromatic number is tight up to an asymptotic factor and it coincides with
a famous algorithmic barrier to colouring random graphs.Comment: 23 page