Erdős–Hajnal conjecture

In graph theory, a branch of mathematics, the Erdős–Hajnal conjecture states that families of graphs defined by forbidden induced subgraphs have either large cliques or large independent sets. It is named for Paul Erdős and András Hajnal.

Unsolved problem in mathematics:
Do the graphs with a fixed forbidden induced subgraph necessarily have large cliques or large independent sets?
(more unsolved problems in mathematics)

More precisely, for an arbitrary undirected graph , let be the family of graphs that do not have as an induced subgraph. Then, according to the conjecture, there exists a constant such that the -vertex graphs in have either a clique or an independent set of size .

An equivalent statement to the original conjecture is that, for every graph , the -free graphs all contain polynomially large perfect induced subgraphs.

Graphs without large cliques or independent sets

In contrast, for random graphs in the Erdős–Rényi model with edge probability 1/2, both the maximum clique and the maximum independent set are much smaller: their size is proportional to the logarithm of , rather than growing polynomially. Ramsey's theorem proves that no graph has both its maximum clique size and maximum independent set size smaller than logarithmic.[1][2] Ramsey's theorem also implies the special case of the Erdős–Hajnal conjecture when itself is a clique or independent set.[1]

Partial results

This conjecture is due to Paul Erdős and András Hajnal, who proved it to be true when is a cograph. They also showed, for arbitrary , that the size of the largest clique or independent set grows superlogarithmically. More precisely, for every there is a constant such that the -vertex -free graphs have cliques or independent sets containing at least vertices.[1][3] The graphs for which the conjecture is true also include the four-vertex path graph,[1][4] the five-vertex bull graph,[1][5] and any graph that can be obtained from these and the cographs by modular decomposition.[1][2] As of 2014, however, the full conjecture has not been proven, and remains an open problem.[1]

An earlier formulation of the conjecture, also by Erdős and Hajnal and still unsolved, concerns the special case when is a 5-vertex cycle graph.[4] The -free graphs include the perfect graphs, which necessarily have either a clique or independent set of size proportional to the square root of their number of vertices. Conversely, every clique or independent set is itself perfect. For this reason, a convenient and symmetric reformulation of the Erdős–Hajnal conjecture is that for every graph , the -free graphs necessarily contain an induced perfect subgraph of polynomial size.[1]

References
  1. Chudnovsky, Maria (2014), "The Erdös–Hajnal conjecture—a survey" (PDF), Journal of Graph Theory, 75 (2): 178–190, arXiv:1606.08827, doi:10.1002/jgt.21730, MR 3150572, Zbl 1280.05086.
  2. Alon, Noga; Pach, János; Solymosi, József (2001), "Ramsey-type theorems with forbidden subgraphs", Combinatorica, 21 (2): 155–170, doi:10.1007/s004930100016, MR 1832443, Zbl 0989.05124.
  3. Erdős, P.; Hajnal, A. (1989), "Ramsey-type theorems", Discrete Applied Mathematics, 25 (1–2): 37–52, doi:10.1016/0166-218X(89)90045-0, MR 1031262, Zbl 0715.05052.
  4. Gyárfás, András (1997), "Reflections on a problem of Erdős and Hajnal", The mathematics of Paul Erdős, II, Algorithms Combin., 14, Springer, Berlin, pp. 93–98, doi:10.1007/978-3-642-60406-5_10, MR 1425208.
  5. Chudnovsky, Maria; Safra, Shmuel (2008), "The Erdős–Hajnal conjecture for bull-free graphs", Journal of Combinatorial Theory, Series B, 98 (6): 1301–1310, doi:10.1016/j.jctb.2008.02.005, MR 2462320.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.