Excluding paths and antipaths

@article{Chudnovsky2015ExcludingPA,
  title={Excluding paths and antipaths},
  author={Maria Chudnovsky and Paul D. Seymour},
  journal={Combinatorica},
  year={2015},
  volume={35},
  pages={389-412}
}
  • Maria Chudnovsky, Paul D. Seymour
  • Published in Combinatorica 2015
  • Mathematics, Computer Science
  • The Erdős-Hajnal conjecture states that for every graph H, there exists a constant δ(H)>0, such that if a graph G has no induced subgraph isomorphic to H, then G contains a clique or a stable set of size at least |V (G)|δ(H). This conjecture is still open. We consider a variant of the conjecture, where instead of excluding H as an induced subgraph, both H and Hc are excluded. We prove this modified conjecture for the case when H is the five-edge path. Our second main result is an asymmetric… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-7 OF 7 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-5 OF 5 REFERENCES

    Ramsey-type theorems

    VIEW 12 EXCERPTS
    HIGHLY INFLUENTIAL

    Some remarks on the theory of graphs

    VIEW 13 EXCERPTS
    HIGHLY INFLUENTIAL

    The Erdös-Hajnal conjecture for bull-free graphs

    VIEW 1 EXCERPT

    N.Robertson, P.Seymour, and R.Thomas, “The strong perfect graph theorem

    • M. Chudnovsky
    • Annals of Math
    • 2006
    VIEW 2 EXCERPTS
    HIGHLY INFLUENTIAL

    Normal hypergraphs and the perfect graph conjecture

    VIEW 1 EXCERPT