The Erdős-Hajnal conjecture. A survey

DOI10.1002/JGT.21730zbMATH Open1280.05086DBLPjournals/jgt/Chudnovsky14arXiv1606.08827OpenAlexW2136450834WikidataQ55969524 ScholiaQ55969524MaRDI QIDQ2874098

Author name not available (Why is that?)

Publication date: 28 January 2014

Published in: (Search for Journal in Brave)

Abstract: The Erd"os-Hajnal conjecture states that for every graph $H$, there exists a constant $delta(H)>0$ such that every graph $G$ with no induced subgraph isomorphic to $H$ has either a clique or a stable set of size at least $|V(G){|}^{delta(H)}$. This paper is a survey of some of the known results on this conjecture.

Full work available at URL: https://arxiv.org/abs/1606.08827

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

This page was built for publication: The Erdős-Hajnal conjecture. A survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874098)