Erdős–Hajnal conjecture (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Erdős–Hajnal conjecture" in English language version.

refsWebsite

Global rank English rank

7doi.org

2^nd place

6ams.org

451^st place

277^th place

3zbmath.org

1,923^rd place

1,068^th place

2arxiv.org

69^th place

59^th place

2semanticscholar.org

11^th place

8^th place

1renyi.hu

low place

1columbia.edu

488^th place

374^th place

1quantamagazine.org

6,413^th place

4,268^th place

1worldcat.org

5^th place

1handle.net

102^nd place

76^th place

ams.org

mathscinet.ams.org

Erdős, P.; Hajnal, A. (1977), "On spanned subgraphs of graphs" (PDF), Contributions to graph theory and its applications (Internat. Colloq., Oberhof, 1977) (German), Tech. Hochschule Ilmenau, Ilmenau, pp. 80–96, MR 0599767.
Gyárfás, András (1997), "Reflections on a problem of Erdős and Hajnal", The mathematics of Paul Erdős, II, Algorithms Combin., vol. 14, Springer, Berlin, pp. 93–98, doi:10.1007/978-3-642-60406-5_10, ISBN 978-3-642-64393-4, MR 1425208.
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, S2CID 985458, Zbl 1280.05086.
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.
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.
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, S2CID 7590638, Zbl 0989.05124.

arxiv.org

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, S2CID 985458, Zbl 1280.05086.
Chudnovsky, Maria; Scott, Alex; Seymour, Paul; Spirkl, Sophie (2023-01-31). "Erdős–Hajnal for graphs with no 5-hole". Proceedings of the London Mathematical Society. 126 (3). Wiley: 997–1014. arXiv:2102.04994. doi:10.1112/plms.12504. ISSN 0024-6115.

columbia.edu

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, S2CID 985458, Zbl 1280.05086.

doi.org

Gyárfás, András (1997), "Reflections on a problem of Erdős and Hajnal", The mathematics of Paul Erdős, II, Algorithms Combin., vol. 14, Springer, Berlin, pp. 93–98, doi:10.1007/978-3-642-60406-5_10, ISBN 978-3-642-64393-4, MR 1425208.
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, S2CID 985458, Zbl 1280.05086.
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.
Chudnovsky, Maria; Scott, Alex; Seymour, Paul; Spirkl, Sophie (2023-01-31). "Erdős–Hajnal for graphs with no 5-hole". Proceedings of the London Mathematical Society. 126 (3). Wiley: 997–1014. arXiv:2102.04994. doi:10.1112/plms.12504. ISSN 0024-6115.
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.
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, S2CID 7590638, Zbl 0989.05124.
Berger, E.; Choromanski, K.; Chudnovsky, M.; Fox, J.; Loebl, M.; Scott, A.; Seymour, P.; Thomasse, S. (2013), "Tournaments and coloring", Journal of Combinatorial Theory, Series B, 103 (1): 1–20, doi:10.1016/j.jctb.2012.08.003, hdl:1721.1/99446.

handle.net

hdl.handle.net

Berger, E.; Choromanski, K.; Chudnovsky, M.; Fox, J.; Loebl, M.; Scott, A.; Seymour, P.; Thomasse, S. (2013), "Tournaments and coloring", Journal of Combinatorial Theory, Series B, 103 (1): 1–20, doi:10.1016/j.jctb.2012.08.003, hdl:1721.1/99446.

quantamagazine.org

Nadis, Steve (26 April 2021). "New Proof Reveals That Graphs With No Pentagons Are Fundamentally Different". Quanta Magazine. Retrieved 2021-04-26.

renyi.hu

old.renyi.hu

Erdős, P.; Hajnal, A. (1977), "On spanned subgraphs of graphs" (PDF), Contributions to graph theory and its applications (Internat. Colloq., Oberhof, 1977) (German), Tech. Hochschule Ilmenau, Ilmenau, pp. 80–96, MR 0599767.

semanticscholar.org

api.semanticscholar.org

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, S2CID 985458, Zbl 1280.05086.
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, S2CID 7590638, Zbl 0989.05124.

worldcat.org

search.worldcat.org

Chudnovsky, Maria; Scott, Alex; Seymour, Paul; Spirkl, Sophie (2023-01-31). "Erdős–Hajnal for graphs with no 5-hole". Proceedings of the London Mathematical Society. 126 (3). Wiley: 997–1014. arXiv:2102.04994. doi:10.1112/plms.12504. ISSN 0024-6115.

zbmath.org

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, S2CID 985458, Zbl 1280.05086.
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.
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, S2CID 7590638, Zbl 0989.05124.