Erdős–Faber–Lovász conjecture (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Erdős–Faber–Lovász conjecture" in English language version.

refsWebsite

Global rank English rank

8doi.org

2^nd place

4ams.org

451^st place

277^th place

4semanticscholar.org

11^th place

8^th place

2arxiv.org

69^th place

59^th place

1psu.edu

207^th place

136^th place

1gilkalai.wordpress.com

low place

1quantamagazine.org

6,413^th place

4,268^th place

1jstor.org

26^th place

20^th place

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Erdős (1981). Erdős, Paul (1981), "On the combinatorial problems which I would most like to see solved", Combinatorica, 1: 25–42, CiteSeerX 10.1.1.294.9566, doi:10.1007/BF02579174, MR 0602413, S2CID 189916865.
Chiang & Lawler (1988). Hindman (1981) describes an equivalent problem in the language of set systems instead of hypergraphs. Hindman, Neil (1981), "On a conjecture of Erdős, Faber, and Lovász about n-colorings", Can. J. Math., 33 (3): 563–570, doi:10.4153/CJM-1981-046-9, MR 0627643, S2CID 124025730.
Hindman (1981). Hindman, Neil (1981), "On a conjecture of Erdős, Faber, and Lovász about n-colorings", Can. J. Math., 33 (3): 563–570, doi:10.4153/CJM-1981-046-9, MR 0627643, S2CID 124025730.
Kahn & Seymour (1992). Kahn, Jeff; Seymour, Paul D. (1992), "A fractional version of the Erdős-Faber-Lovász conjecture", Combinatorica, 12 (2): 155–160, doi:10.1007/BF01204719, MR 1179253, S2CID 6144958.

arxiv.org (Global: 69^th place; English: 59^th place)

Kalai (2021); Kang et al. (2023); Houston-Edwards (2021) Kalai, Gil (January 14, 2021), "To cheer you up in difficult times 17: Amazing! The Erdős-Faber-Lovász conjecture (for large n) was proved by Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, and Deryk Osthus!", Combinatorics and more Kang, Dong Yeap; Kelly, Tom; Kühn, Daniela; Methuku, Abhishek; Osthus, Deryk (2023), "A proof of the Erdős-Faber-Lovász conjecture", Annals of Mathematics, 198 (2): 537–618, arXiv:2101.04698, doi:10.4007/annals.2023.198.2.2 Houston-Edwards, Kelsey (April 5, 2021), "Mathematicians settle Erdős coloring conjecture", Quanta Magazine
Kang et al. (2023). Kang, Dong Yeap; Kelly, Tom; Kühn, Daniela; Methuku, Abhishek; Osthus, Deryk (2023), "A proof of the Erdős-Faber-Lovász conjecture", Annals of Mathematics, 198 (2): 537–618, arXiv:2101.04698, doi:10.4007/annals.2023.198.2.2

doi.org (Global: 2^nd place; English: 2^nd place)

Erdős (1981). Erdős, Paul (1981), "On the combinatorial problems which I would most like to see solved", Combinatorica, 1: 25–42, CiteSeerX 10.1.1.294.9566, doi:10.1007/BF02579174, MR 0602413, S2CID 189916865.
Kalai (2021); Kang et al. (2023); Houston-Edwards (2021) Kalai, Gil (January 14, 2021), "To cheer you up in difficult times 17: Amazing! The Erdős-Faber-Lovász conjecture (for large n) was proved by Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, and Deryk Osthus!", Combinatorics and more Kang, Dong Yeap; Kelly, Tom; Kühn, Daniela; Methuku, Abhishek; Osthus, Deryk (2023), "A proof of the Erdős-Faber-Lovász conjecture", Annals of Mathematics, 198 (2): 537–618, arXiv:2101.04698, doi:10.4007/annals.2023.198.2.2 Houston-Edwards, Kelsey (April 5, 2021), "Mathematicians settle Erdős coloring conjecture", Quanta Magazine
Chiang & Lawler (1988). Hindman (1981) describes an equivalent problem in the language of set systems instead of hypergraphs. Hindman, Neil (1981), "On a conjecture of Erdős, Faber, and Lovász about n-colorings", Can. J. Math., 33 (3): 563–570, doi:10.4153/CJM-1981-046-9, MR 0627643, S2CID 124025730.
Hindman (1981). Hindman, Neil (1981), "On a conjecture of Erdős, Faber, and Lovász about n-colorings", Can. J. Math., 33 (3): 563–570, doi:10.4153/CJM-1981-046-9, MR 0627643, S2CID 124025730.
Kahn (1997). Kahn, Jeff (1997), "On Some Hypergraph Problems of Paul Erdős and the Asymptotics of Matchings, Covers and Colorings", The Mathematics of Paul Erdös I, Algorithms and Combinatorics, vol. 13, Springer Berlin Heidelber, pp. 345–371, doi:10.1007/978-3-642-60408-9_26, ISBN 978-3-642-60408-9
Kang et al. (2023). Kang, Dong Yeap; Kelly, Tom; Kühn, Daniela; Methuku, Abhishek; Osthus, Deryk (2023), "A proof of the Erdős-Faber-Lovász conjecture", Annals of Mathematics, 198 (2): 537–618, arXiv:2101.04698, doi:10.4007/annals.2023.198.2.2
Erdős (1991); Horák & Tuza (1990). Erdős, Paul (1991), "Advanced problem 6664", American Mathematical Monthly, 98 (7), Mathematical Association of America: 655, doi:10.2307/2324942, JSTOR 2324942. Solutions by Ilias Kastanas, Charles Vanden Eynden, and Richard Holzsager, American Mathematical Monthly 100 (7): 692–693, 1992. Horák, P.; Tuza, Z. (1990), "A coloring problem related to the Erdős–Faber–Lovász conjecture", Journal of Combinatorial Theory, Series B, 50 (2): 321–322, doi:10.1016/0095-8956(90)90087-G. Corrected in JCTB 51 (2): 329, 1991, to add Tuza's name as coauthor.
Kahn & Seymour (1992). Kahn, Jeff; Seymour, Paul D. (1992), "A fractional version of the Erdős-Faber-Lovász conjecture", Combinatorica, 12 (2): 155–160, doi:10.1007/BF01204719, MR 1179253, S2CID 6144958.

gilkalai.wordpress.com (Global: low place; English: low place)

Kalai (2021); Kang et al. (2023); Houston-Edwards (2021) Kalai, Gil (January 14, 2021), "To cheer you up in difficult times 17: Amazing! The Erdős-Faber-Lovász conjecture (for large n) was proved by Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, and Deryk Osthus!", Combinatorics and more Kang, Dong Yeap; Kelly, Tom; Kühn, Daniela; Methuku, Abhishek; Osthus, Deryk (2023), "A proof of the Erdős-Faber-Lovász conjecture", Annals of Mathematics, 198 (2): 537–618, arXiv:2101.04698, doi:10.4007/annals.2023.198.2.2 Houston-Edwards, Kelsey (April 5, 2021), "Mathematicians settle Erdős coloring conjecture", Quanta Magazine

jstor.org (Global: 26^th place; English: 20^th place)

Erdős (1991); Horák & Tuza (1990). Erdős, Paul (1991), "Advanced problem 6664", American Mathematical Monthly, 98 (7), Mathematical Association of America: 655, doi:10.2307/2324942, JSTOR 2324942. Solutions by Ilias Kastanas, Charles Vanden Eynden, and Richard Holzsager, American Mathematical Monthly 100 (7): 692–693, 1992. Horák, P.; Tuza, Z. (1990), "A coloring problem related to the Erdős–Faber–Lovász conjecture", Journal of Combinatorial Theory, Series B, 50 (2): 321–322, doi:10.1016/0095-8956(90)90087-G. Corrected in JCTB 51 (2): 329, 1991, to add Tuza's name as coauthor.

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Erdős (1981). Erdős, Paul (1981), "On the combinatorial problems which I would most like to see solved", Combinatorica, 1: 25–42, CiteSeerX 10.1.1.294.9566, doi:10.1007/BF02579174, MR 0602413, S2CID 189916865.

quantamagazine.org (Global: 6,413^th place; English: 4,268^th place)

Kalai (2021); Kang et al. (2023); Houston-Edwards (2021) Kalai, Gil (January 14, 2021), "To cheer you up in difficult times 17: Amazing! The Erdős-Faber-Lovász conjecture (for large n) was proved by Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, and Deryk Osthus!", Combinatorics and more Kang, Dong Yeap; Kelly, Tom; Kühn, Daniela; Methuku, Abhishek; Osthus, Deryk (2023), "A proof of the Erdős-Faber-Lovász conjecture", Annals of Mathematics, 198 (2): 537–618, arXiv:2101.04698, doi:10.4007/annals.2023.198.2.2 Houston-Edwards, Kelsey (April 5, 2021), "Mathematicians settle Erdős coloring conjecture", Quanta Magazine

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Erdős (1981). Erdős, Paul (1981), "On the combinatorial problems which I would most like to see solved", Combinatorica, 1: 25–42, CiteSeerX 10.1.1.294.9566, doi:10.1007/BF02579174, MR 0602413, S2CID 189916865.
Chiang & Lawler (1988). Hindman (1981) describes an equivalent problem in the language of set systems instead of hypergraphs. Hindman, Neil (1981), "On a conjecture of Erdős, Faber, and Lovász about n-colorings", Can. J. Math., 33 (3): 563–570, doi:10.4153/CJM-1981-046-9, MR 0627643, S2CID 124025730.
Hindman (1981). Hindman, Neil (1981), "On a conjecture of Erdős, Faber, and Lovász about n-colorings", Can. J. Math., 33 (3): 563–570, doi:10.4153/CJM-1981-046-9, MR 0627643, S2CID 124025730.
Kahn & Seymour (1992). Kahn, Jeff; Seymour, Paul D. (1992), "A fractional version of the Erdős-Faber-Lovász conjecture", Combinatorica, 12 (2): 155–160, doi:10.1007/BF01204719, MR 1179253, S2CID 6144958.

Erdős–Faber–Lovász conjecture (English Wikipedia)

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

arxiv.org (Global: 69th place; English: 59th place)

doi.org (Global: 2nd place; English: 2nd place)