Kneser graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Kneser graph" in English language version.

refsWebsite

Global rank English rank

11doi.org

2^nd place

11ams.org

451^st place

277^th place

2handle.net

102^nd place

76^th place

2arxiv.org

69^th place

59^th place

1jstor.org

26^th place

20^th place

1semanticscholar.org

11^th place

8^th place

1cambridge.org

305^th place

264^th place

1archive-it.org

910^th place

593^rd place

1ncsu.edu

2,542^nd place

1,675^th place

1web.archive.org

1^st place

1caltech.edu

887^th place

714^th place

1escholarship.org

1,523^rd place

976^th place

ams.org

mathscinet.ams.org

Watkins (1970). Watkins, Mark E. (1970), "Connectivity of transitive graphs", Journal of Combinatorial Theory, 8: 23–29, doi:10.1016/S0021-9800(70)80005-9, MR 0266804
Lovász (1978). Lovász, László (1978), "Kneser's conjecture, chromatic number, and homotopy", Journal of Combinatorial Theory, Series A, 25 (3): 319–324, doi:10.1016/0097-3165(78)90022-5, hdl:10338.dmlcz/126050, MR 0514625
Bárány (1978). Bárány, Imre (1978), "A short proof of Kneser's conjecture", Journal of Combinatorial Theory, Series A, 25 (3): 325–326, doi:10.1016/0097-3165(78)90023-7, MR 0514626
Greene (2002). Greene, Joshua E. (2002), "A new short proof of Kneser's conjecture", American Mathematical Monthly, 109 (10): 918–920, doi:10.2307/3072460, JSTOR 3072460, MR 1941810
Matoušek (2004). Matoušek, Jiří (2004), "A combinatorial proof of Kneser's conjecture", Combinatorica, 24 (1): 163–170, doi:10.1007/s00493-004-0011-1, hdl:20.500.11850/50671, MR 2057690, S2CID 42583803
Chen (2003). Chen, Ya-Chen (2003), "Triangle-free Hamiltonian Kneser graphs", Journal of Combinatorial Theory, Series B, 89 (1): 1–16, doi:10.1016/S0095-8956(03)00040-6, MR 1999733
Mütze, Nummenpalo & Walczak (2021). Mütze, Torsten; Nummenpalo, Jerri; Walczak, Bartosz (2021) [STOC 2018], "Sparse Kneser graphs are Hamiltonian", Journal of the London Mathematical Society, 103 (4), New York: 912–919, arXiv:1711.01636, doi:10.1112/jlms.12406, MR 3826304
Denley (1997). Denley, Tristan (1997), "The odd girth of the generalised Kneser graph", European Journal of Combinatorics, 18 (6): 607–611, doi:10.1006/eujc.1996.0122, MR 1468332
Valencia-Pabon & Vera (2005). Valencia-Pabon, Mario; Vera, Juan-Carlos (2005), "On the diameter of Kneser graphs", Discrete Mathematics, 305 (1–3): 383–385, doi:10.1016/j.disc.2005.10.001, MR 2186709
Chau et al. (2025). Chau, Hou Tin; Ellis, David; Friedgut, Ehud; Lifshitz, Noam (2025), "On the maximum degree of induced subgraphs of the Kneser graph", Combinatorial Theory, 5 (1), Paper#16, doi:10.5070/C65165027, MR 4882080
Simpson (1991). Simpson, J. E. (1991), "Hamiltonian bipartite graphs", Proceedings of the Twenty-Second Southeastern Conference on Combinatorics, Graph Theory, and Computing (Baton Rouge, LA, 1991), Congressus Numerantium, vol. 85, pp. 97–110, MR 1152123

archive-it.org

wayback.archive-it.org

Shields (2004). Shields, Ian Beaumont (2004), Hamilton Cycle Heuristics in Hard Graphs, Ph.D. thesis, North Carolina State University, archived from the original on 2006-09-17, retrieved 2006-10-01

arxiv.org

Mütze, Nummenpalo & Walczak (2021). Mütze, Torsten; Nummenpalo, Jerri; Walczak, Bartosz (2021) [STOC 2018], "Sparse Kneser graphs are Hamiltonian", Journal of the London Mathematical Society, 103 (4), New York: 912–919, arXiv:1711.01636, doi:10.1112/jlms.12406, MR 3826304
Merino, Mütze & Namrata (2023). Merino, Arturo; Mütze, Torsten; Namrata (2023), "Kneser graphs are Hamiltonian", Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pp. 963–970, arXiv:2212.03918, doi:10.1145/3564246.3585137, ISBN 978-1-4503-9913-5

caltech.edu

math.caltech.edu

"Archived copy" (PDF). www.math.caltech.edu. Archived from the original (PDF) on 23 March 2012. Retrieved 9 August 2022.{{cite web}}: CS1 maint: archived copy as title (link)

cambridge.org

Godsil & Meagher (2015). Godsil, Christopher; Meagher, Karen (2015), Erdős–Ko–Rado Theorems: Algebraic Approaches, Cambridge Studies in Advanced Mathematics, Cambridge University Press, p. 43, ISBN 9781107128446

doi.org

Watkins (1970). Watkins, Mark E. (1970), "Connectivity of transitive graphs", Journal of Combinatorial Theory, 8: 23–29, doi:10.1016/S0021-9800(70)80005-9, MR 0266804
Lovász (1978). Lovász, László (1978), "Kneser's conjecture, chromatic number, and homotopy", Journal of Combinatorial Theory, Series A, 25 (3): 319–324, doi:10.1016/0097-3165(78)90022-5, hdl:10338.dmlcz/126050, MR 0514625
Bárány (1978). Bárány, Imre (1978), "A short proof of Kneser's conjecture", Journal of Combinatorial Theory, Series A, 25 (3): 325–326, doi:10.1016/0097-3165(78)90023-7, MR 0514626
Greene (2002). Greene, Joshua E. (2002), "A new short proof of Kneser's conjecture", American Mathematical Monthly, 109 (10): 918–920, doi:10.2307/3072460, JSTOR 3072460, MR 1941810
Matoušek (2004). Matoušek, Jiří (2004), "A combinatorial proof of Kneser's conjecture", Combinatorica, 24 (1): 163–170, doi:10.1007/s00493-004-0011-1, hdl:20.500.11850/50671, MR 2057690, S2CID 42583803
Chen (2003). Chen, Ya-Chen (2003), "Triangle-free Hamiltonian Kneser graphs", Journal of Combinatorial Theory, Series B, 89 (1): 1–16, doi:10.1016/S0095-8956(03)00040-6, MR 1999733
Mütze, Nummenpalo & Walczak (2021). Mütze, Torsten; Nummenpalo, Jerri; Walczak, Bartosz (2021) [STOC 2018], "Sparse Kneser graphs are Hamiltonian", Journal of the London Mathematical Society, 103 (4), New York: 912–919, arXiv:1711.01636, doi:10.1112/jlms.12406, MR 3826304
Merino, Mütze & Namrata (2023). Merino, Arturo; Mütze, Torsten; Namrata (2023), "Kneser graphs are Hamiltonian", Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pp. 963–970, arXiv:2212.03918, doi:10.1145/3564246.3585137, ISBN 978-1-4503-9913-5
Denley (1997). Denley, Tristan (1997), "The odd girth of the generalised Kneser graph", European Journal of Combinatorics, 18 (6): 607–611, doi:10.1006/eujc.1996.0122, MR 1468332
Valencia-Pabon & Vera (2005). Valencia-Pabon, Mario; Vera, Juan-Carlos (2005), "On the diameter of Kneser graphs", Discrete Mathematics, 305 (1–3): 383–385, doi:10.1016/j.disc.2005.10.001, MR 2186709
Chau et al. (2025). Chau, Hou Tin; Ellis, David; Friedgut, Ehud; Lifshitz, Noam (2025), "On the maximum degree of induced subgraphs of the Kneser graph", Combinatorial Theory, 5 (1), Paper#16, doi:10.5070/C65165027, MR 4882080

escholarship.org

Chowdhury, Ameerah Naz (2012). Shadows and Intersections (PhD Thesis). University of California, San Diego: ProQuest Dissertations & Theses. p. 47. Retrieved 21 May 2025.

handle.net

hdl.handle.net

Lovász (1978). Lovász, László (1978), "Kneser's conjecture, chromatic number, and homotopy", Journal of Combinatorial Theory, Series A, 25 (3): 319–324, doi:10.1016/0097-3165(78)90022-5, hdl:10338.dmlcz/126050, MR 0514625
Matoušek (2004). Matoušek, Jiří (2004), "A combinatorial proof of Kneser's conjecture", Combinatorica, 24 (1): 163–170, doi:10.1007/s00493-004-0011-1, hdl:20.500.11850/50671, MR 2057690, S2CID 42583803

jstor.org

Greene (2002). Greene, Joshua E. (2002), "A new short proof of Kneser's conjecture", American Mathematical Monthly, 109 (10): 918–920, doi:10.2307/3072460, JSTOR 3072460, MR 1941810

ncsu.edu

lib.ncsu.edu

Shields (2004). Shields, Ian Beaumont (2004), Hamilton Cycle Heuristics in Hard Graphs, Ph.D. thesis, North Carolina State University, archived from the original on 2006-09-17, retrieved 2006-10-01

semanticscholar.org

api.semanticscholar.org

Matoušek (2004). Matoušek, Jiří (2004), "A combinatorial proof of Kneser's conjecture", Combinatorica, 24 (1): 163–170, doi:10.1007/s00493-004-0011-1, hdl:20.500.11850/50671, MR 2057690, S2CID 42583803

web.archive.org

"Archived copy" (PDF). www.math.caltech.edu. Archived from the original (PDF) on 23 March 2012. Retrieved 9 August 2022.{{cite web}}: CS1 maint: archived copy as title (link)