Aravind, N. R. and Cambie, Stijn and Cames van Batenburg, Wouter and De Joannis de Verclos, Rémi and Kang, Ross J. and Patel, Viresh
(2021)
Structure and Colour in TriangleFree Graphs.
The Electronic Journal of Combinatorics, 28 (2).
ISSN 10778926
Full text not available from this repository.
(
Request a copy)
Abstract
Motivated by a recent conjecture of the first author, we prove that every properly coloured trianglefree graph of chromatic number χ contains a rainbow independent set of size ⌈12χ⌉. This is sharp up to a factor 2. This result and its short proof have implications for the related notion of chromatic discrepancy. Drawing inspiration from both structural and extremal graph theory, we conjecture that every trianglefree graph of chromatic number χ contains an induced cycle of length Ω(χ log χ) as χ → ∞. Even if one only demands an induced path of length Ω(χ log χ), the conclusion would be sharp up to a constant multiple. We prove it for regular girth 5 graphs and for girth 21 graphs. As a common strengthening of the induced paths form of this conjecture and of Johansson’s theorem (1996), we posit the existence of some c > 0 such that for every forest H on D vertices, every trianglefree and induced Hfree graph has chromatic number at most cD/ log D. We prove this assertion with ‘trianglefree’ replaced by ‘regular girth 5’.
[error in script]
Actions (login required)

View Item 