The Erdős--Hajnal property for paths
Shenwei Huang, Yidong Zhou, Yuwen Zhou
Abstract
The well-known Erdős-Hajnal conjecture states that for any graph H, there is a constant c=c(H)>0 such that every n-vertex graph G with no induced copies of H contains a clique or an independent set of size at least nc. In this paper, we prove that the Erdős-Hajnal conjecture holds for every path.
Create a lesson
Related papers
Fractional colorings of Kr-free graphs with local demands
Ewan Davies, Abhishek Dhawan, Abhishek Methuku et al.
Short permutation pattern waves: The complete length-five classification
Lihong Qiu, Minglei Mao, Yaping Mao
Automatic partition identities
Laurent Bartholdi
Well-Covered Powers: Cartesian Products and Cayley Graphs
Haobo Ma, Thanh Vu, Wenlin Zhang
Lemmas and Conjectures in Spectral Graph Theory
Tristan Cazenave
On the lower- and upper bounds of three-colored anti-Ramsey numbers
Máté Giesz