Add to ORKGErdős and Hajnal conjectured that, for every graph H, there exists a constant cH such that every graph G on n vertices which does not contain any induced copy of H has a clique or a stable set of size ncH. We prove that for every k, there exists ck> 0 such that every graph G on n vertices not inducing a cycle of length at least k nor its complement contains a clique or a stable set of size nck
The final publication is available at Elsevier via https://doi.org/10.1016/j.aim.2020.107396. © 2020...
International audienceWe prove that for every k, there exists c k > 0 such that every graph G on n v...
The Erdős-Hajnal conjecture says that for every graph H there exists c > 0 such that max(α(G), ω(G))...
International audienceErdös and Hajnal conjectured that for every graph $H$, there exists a constant...
International audienceErdös and Hajnal conjectured that for every graph $H$, there exists a constant...
Abstract The Erdős-Hajnal conjecture states that for every graph H, there exists a constant δ(H) >...
The Erdos-Hajnal conjecture says that for every graph H there exists c>0 such that every graph G ...
International audienceWe prove that for every k, there exists c k > 0 such that every graph G on n v...
International audienceWe prove that for every k, there exists c k > 0 such that every graph G on n v...
The ErdAs-Hajnal conjecture states that for every graph H, there exists a constant delta(H)> 0, such...
The long-standing Erdős-Hajnal conjecture states that for every n-vertex undirected graph H there ex...
The Erdős-Hajnal conjecture asserts that for every graph H there is a constant c > 0 such that every...
The bull is a graph consisting of a triangle and two pendant edges. A graphs is called bull-free if ...
International audienceWe prove that for every k, there exists c k > 0 such that every graph G on n v...
Erdos and Hajnal conjectured that for every graph H there is a constant ε =ε (H) > 0 such that every...
The final publication is available at Elsevier via https://doi.org/10.1016/j.aim.2020.107396. © 2020...
International audienceWe prove that for every k, there exists c k > 0 such that every graph G on n v...
The Erdős-Hajnal conjecture says that for every graph H there exists c > 0 such that max(α(G), ω(G))...
International audienceErdös and Hajnal conjectured that for every graph $H$, there exists a constant...
International audienceErdös and Hajnal conjectured that for every graph $H$, there exists a constant...
Abstract The Erdős-Hajnal conjecture states that for every graph H, there exists a constant δ(H) >...
The Erdos-Hajnal conjecture says that for every graph H there exists c>0 such that every graph G ...
International audienceWe prove that for every k, there exists c k > 0 such that every graph G on n v...
International audienceWe prove that for every k, there exists c k > 0 such that every graph G on n v...
The ErdAs-Hajnal conjecture states that for every graph H, there exists a constant delta(H)> 0, such...
The long-standing Erdős-Hajnal conjecture states that for every n-vertex undirected graph H there ex...
The Erdős-Hajnal conjecture asserts that for every graph H there is a constant c > 0 such that every...
The bull is a graph consisting of a triangle and two pendant edges. A graphs is called bull-free if ...
International audienceWe prove that for every k, there exists c k > 0 such that every graph G on n v...
Erdos and Hajnal conjectured that for every graph H there is a constant ε =ε (H) > 0 such that every...
The final publication is available at Elsevier via https://doi.org/10.1016/j.aim.2020.107396. © 2020...
International audienceWe prove that for every k, there exists c k > 0 such that every graph G on n v...
The Erdős-Hajnal conjecture says that for every graph H there exists c > 0 such that max(α(G), ω(G))...