Handshaking lemma (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Handshaking lemma" in English language version.

refsWebsite

Global rank English rank

14doi.org

2^nd place

12books.google.com

3^rd place

11ams.org

451^st place

277^th place

3semanticscholar.org

11^th place

8^th place

2jstor.org

26^th place

20^th place

2arxiv.org

69^th place

59^th place

1pacific.edu

low place

1dtic.mil

833^rd place

567^th place

1web.archive.org

1^st place

1numdam.org

8,650^th place

7,668^th place

1maa.org

3,479^th place

2,444^th place

1archive.org

6^th place

1quantamagazine.org

6,413^th place

4,268^th place

1weizmann.ac.il

4,983^rd place

8,002^nd place

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

mathscinet.ams.org

Cameron, Kathie; Edmonds, Jack (1999), "Some graphic uses of an even number of odd nodes", Annales de l'Institut Fourier, 49 (3): 815–827, doi:10.5802/aif.1694, MR 1703426
Thomason, A. G. (1978), "Hamiltonian cycles and uniquely edge colourable graphs", Advances in Graph Theory (Cambridge Combinatorial Conf., Trinity College, Cambridge, 1977), Annals of Discrete Mathematics, vol. 3, pp. 259–268, doi:10.1016/S0167-5060(08)70511-9, ISBN 978-0-7204-0843-0, MR 0499124
Aigner, Martin; Ziegler, Günter M. (2018), "Section 28.6: Sperner's Lemma", Proofs from THE BOOK (6th ed.), Berlin: Springer, pp. 203–205, doi:10.1007/978-3-662-57265-8, ISBN 978-3-662-57264-1, MR 3823190
Goodman, Jacob E.; Pach, János; Yap, Chee-K. (1989), "Mountain climbing, ladder moving, and the ring-width of a polygon" (PDF), The American Mathematical Monthly, 96 (6): 494–510, doi:10.2307/2323971, JSTOR 2323971, MR 0999412
Lauri, Josef; Scapellato, Raffaele (2016), Topics in Graph Automorphisms and Reconstruction, London Mathematical Society Lecture Note Series, vol. 432 (2nd ed.), Cambridge University Press, pp. 105–106, doi:10.1017/CBO9781316669846, ISBN 978-1-316-61044-2, MR 3496604
Gale, David (1979), "The game of Hex and the Brouwer fixed-point theorem", The American Mathematical Monthly, 86 (10): 818–827, doi:10.1080/00029890.1979.11994922, JSTOR 2320146, MR 0551501
Pisanski, Tomaž; Servatius, Brigitte (2013), "2.3.4: Semiregular Bipartite Graphs", Configurations from a Graphical Viewpoint, Birkhäuser Advanced Texts: Basler Lehrbücher, New York: Birkhäuser/Springer, p. 35, doi:10.1007/978-0-8176-8364-1, ISBN 978-0-8176-8363-4, MR 2978043
Bruhn, Henning; Stein, Maya (2007), "On end degrees and infinite cycles in locally finite graphs", Combinatorica, 27 (3): 269–291, doi:10.1007/s00493-007-2149-0, MR 2345811, S2CID 8367713; see Proposition 15, p. 284
Ferber, Asaf; Krivelevich, Michael (2022), "Every graph contains a linearly sized induced subgraph with all degrees odd", Advances in Mathematics, 406 108534, arXiv:2009.05495, doi:10.1016/j.aim.2022.108534, MR 4448268
Papadimitriou, Christos H. (1994), "On the complexity of the parity argument and other inefficient proofs of existence", Journal of Computer and System Sciences, 48 (3): 498–532, doi:10.1016/S0022-0000(05)80063-7, MR 1279412
Grigni, Michelangelo (2001), "A Sperner lemma complete for PPA", Information Processing Letters, 77 (5–6): 255–259, doi:10.1016/S0020-0190(00)00152-6, MR 1818525

archive.org (Global: 6^th place; English: 6^th place)

Aldous, Joan M.; Wilson, Robin J. (2000), "Theorem 2.2", Graphs and Applications: an Introductory Approach, Undergraduate Mathematics Series, The Open University, Springer-Verlag, p. 44, ISBN 978-1-85233-259-4

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

Ferber, Asaf; Krivelevich, Michael (2022), "Every graph contains a linearly sized induced subgraph with all degrees odd", Advances in Mathematics, 406 108534, arXiv:2009.05495, doi:10.1016/j.aim.2022.108534, MR 4448268
Filos-Ratsikas, Aris; Goldberg, Paul W. (2018), "Consensus halving is PPA-complete", in Diakonikolas, Ilias; Kempe, David; Henzinger, Monika (eds.), Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018, pp. 51–64, arXiv:1711.04503, doi:10.1145/3188745.3188880, ISBN 978-1-4503-5559-9, S2CID 8111195

books.google.com (Global: 3^rd place; English: 3^rd place)

Hein, James L. (2015), "Example 3: The Handshaking Problem", Discrete Structures, Logic, and Computability, Jones & Bartlett Publishers, p. 703, ISBN 9781284070408
Gunderson, David S. (2014), Handbook of Mathematical Induction: Theory and Applications, CRC Press, p. 240, ISBN 9781420093650
Higgins, Peter M. (1998), Mathematics for the Curious, Oxford University Press, p. 201, ISBN 9780192880727
Biggs, Norman L. (2002), "15.3: Degree", Discrete Mathematics, Oxford University Press, pp. 181–182, ISBN 9780198507178
Loehr, Nicholas (2011), "3.31. Theorem: Degree-Sum Formula for Digraphs", Bijective Combinatorics, CRC Press, p. 106, ISBN 9781439848869
Ray, Santanu Saha (2012), "Theorem 2.2", Graph Theory with Algorithms and its Applications in Applied Science and Technology, Springer, p. 16, ISBN 9788132207504
Lauri, Josef; Scapellato, Raffaele (2016), Topics in Graph Automorphisms and Reconstruction, London Mathematical Society Lecture Note Series, vol. 432 (2nd ed.), Cambridge University Press, pp. 105–106, doi:10.1017/CBO9781316669846, ISBN 978-1-316-61044-2, MR 3496604
Neto, Antonio Caminha Muniz (2018), An Excursion through Elementary Mathematics, Volume III: Discrete Mathematics and Polynomial Algebra, Problem Books in Mathematics, Springer, pp. 132, 562, ISBN 9783319779775
Wallis, W. D. (2011), "Section 7.1, Introduction to Graphs, Corollary 1", A Beginner's Guide to Discrete Mathematics (2nd ed.), Springer, p. 219, ISBN 9780817682866
Clark, John; Holton, Derek Allan (1995), "Problem 1.4.6", A First Look at Graph Theory, Allied Publishers, p. 16, ISBN 9788170234630
Lovász, László (2014), Combinatorial Problems and Exercises (2nd ed.), Elsevier, p. 281, ISBN 9780080933092
Pisanski, Tomaž; Servatius, Brigitte (2013), "2.3.4: Semiregular Bipartite Graphs", Configurations from a Graphical Viewpoint, Birkhäuser Advanced Texts: Basler Lehrbücher, New York: Birkhäuser/Springer, p. 35, doi:10.1007/978-0-8176-8364-1, ISBN 978-0-8176-8363-4, MR 2978043

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

Jukna, Stasys (2011), "Proposition 1.7", Extremal Combinatorics, Texts in Theoretical Computer Science. An EATCS Series, Springer, p. 9, doi:10.1007/978-3-642-17364-6, ISBN 978-3-642-17363-9
Cameron, Kathie; Edmonds, Jack (1999), "Some graphic uses of an even number of odd nodes", Annales de l'Institut Fourier, 49 (3): 815–827, doi:10.5802/aif.1694, MR 1703426
Thomason, A. G. (1978), "Hamiltonian cycles and uniquely edge colourable graphs", Advances in Graph Theory (Cambridge Combinatorial Conf., Trinity College, Cambridge, 1977), Annals of Discrete Mathematics, vol. 3, pp. 259–268, doi:10.1016/S0167-5060(08)70511-9, ISBN 978-0-7204-0843-0, MR 0499124
Aigner, Martin; Ziegler, Günter M. (2018), "Section 28.6: Sperner's Lemma", Proofs from THE BOOK (6th ed.), Berlin: Springer, pp. 203–205, doi:10.1007/978-3-662-57265-8, ISBN 978-3-662-57264-1, MR 3823190
Goodman, Jacob E.; Pach, János; Yap, Chee-K. (1989), "Mountain climbing, ladder moving, and the ring-width of a polygon" (PDF), The American Mathematical Monthly, 96 (6): 494–510, doi:10.2307/2323971, JSTOR 2323971, MR 0999412
Lauri, Josef; Scapellato, Raffaele (2016), Topics in Graph Automorphisms and Reconstruction, London Mathematical Society Lecture Note Series, vol. 432 (2nd ed.), Cambridge University Press, pp. 105–106, doi:10.1017/CBO9781316669846, ISBN 978-1-316-61044-2, MR 3496604
Gale, David (1979), "The game of Hex and the Brouwer fixed-point theorem", The American Mathematical Monthly, 86 (10): 818–827, doi:10.1080/00029890.1979.11994922, JSTOR 2320146, MR 0551501
Pisanski, Tomaž; Servatius, Brigitte (2013), "2.3.4: Semiregular Bipartite Graphs", Configurations from a Graphical Viewpoint, Birkhäuser Advanced Texts: Basler Lehrbücher, New York: Birkhäuser/Springer, p. 35, doi:10.1007/978-0-8176-8364-1, ISBN 978-0-8176-8363-4, MR 2978043
Bruhn, Henning; Stein, Maya (2007), "On end degrees and infinite cycles in locally finite graphs", Combinatorica, 27 (3): 269–291, doi:10.1007/s00493-007-2149-0, MR 2345811, S2CID 8367713; see Proposition 15, p. 284
Ferber, Asaf; Krivelevich, Michael (2022), "Every graph contains a linearly sized induced subgraph with all degrees odd", Advances in Mathematics, 406 108534, arXiv:2009.05495, doi:10.1016/j.aim.2022.108534, MR 4448268
Papadimitriou, Christos H. (1994), "On the complexity of the parity argument and other inefficient proofs of existence", Journal of Computer and System Sciences, 48 (3): 498–532, doi:10.1016/S0022-0000(05)80063-7, MR 1279412
Chen, Xi; Deng, Xiaotie (2006), "Settling the complexity of two-player Nash equilibrium", Proc. 47th Symp. Foundations of Computer Science, pp. 261–271, doi:10.1109/FOCS.2006.69, ISBN 0-7695-2720-5, S2CID 14102058, ECCC TR05-140
Grigni, Michelangelo (2001), "A Sperner lemma complete for PPA", Information Processing Letters, 77 (5–6): 255–259, doi:10.1016/S0020-0190(00)00152-6, MR 1818525
Filos-Ratsikas, Aris; Goldberg, Paul W. (2018), "Consensus halving is PPA-complete", in Diakonikolas, Ilias; Kempe, David; Henzinger, Monika (eds.), Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018, pp. 51–64, arXiv:1711.04503, doi:10.1145/3188745.3188880, ISBN 978-1-4503-5559-9, S2CID 8111195

dtic.mil (Global: 833^rd place; English: 567^th place)

apps.dtic.mil

Christofides, Nicos (1976), Worst-case analysis of a new heuristic for the travelling salesman problem (PDF), Report 388, Graduate School of Industrial Administration, CMU, archived (PDF) from the original on 2019-07-21. The handshaking lemma is cited at the top of page 2.

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

Goodman, Jacob E.; Pach, János; Yap, Chee-K. (1989), "Mountain climbing, ladder moving, and the ring-width of a polygon" (PDF), The American Mathematical Monthly, 96 (6): 494–510, doi:10.2307/2323971, JSTOR 2323971, MR 0999412
Gale, David (1979), "The game of Hex and the Brouwer fixed-point theorem", The American Mathematical Monthly, 86 (10): 818–827, doi:10.1080/00029890.1979.11994922, JSTOR 2320146, MR 0551501

maa.org (Global: 3,479^th place; English: 2,444^th place)

Goodman, Jacob E.; Pach, János; Yap, Chee-K. (1989), "Mountain climbing, ladder moving, and the ring-width of a polygon" (PDF), The American Mathematical Monthly, 96 (6): 494–510, doi:10.2307/2323971, JSTOR 2323971, MR 0999412

numdam.org (Global: 8,650^th place; English: 7,668^th place)

Cameron, Kathie; Edmonds, Jack (1999), "Some graphic uses of an even number of odd nodes", Annales de l'Institut Fourier, 49 (3): 815–827, doi:10.5802/aif.1694, MR 1703426

pacific.edu (Global: low place; English: low place)

scholarlycommons.pacific.edu

Euler, L. (1736), "Solutio problematis ad geometriam situs pertinentis", Commentarii Academiae Scientiarum Imperialis Petropolitanae, 8: 128–140. Reprinted and translated in Biggs, N. L.; Lloyd, E. K.; Wilson, R. J. (1976), Graph Theory 1736–1936, Oxford University Press

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

Honner, Patrick (March 24, 2022), "What a Math Party Game Tells Us About Graph Theory", Quanta, retrieved 2022-03-27

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

api.semanticscholar.org

Bruhn, Henning; Stein, Maya (2007), "On end degrees and infinite cycles in locally finite graphs", Combinatorica, 27 (3): 269–291, doi:10.1007/s00493-007-2149-0, MR 2345811, S2CID 8367713; see Proposition 15, p. 284
Chen, Xi; Deng, Xiaotie (2006), "Settling the complexity of two-player Nash equilibrium", Proc. 47th Symp. Foundations of Computer Science, pp. 261–271, doi:10.1109/FOCS.2006.69, ISBN 0-7695-2720-5, S2CID 14102058, ECCC TR05-140
Filos-Ratsikas, Aris; Goldberg, Paul W. (2018), "Consensus halving is PPA-complete", in Diakonikolas, Ilias; Kempe, David; Henzinger, Monika (eds.), Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018, pp. 51–64, arXiv:1711.04503, doi:10.1145/3188745.3188880, ISBN 978-1-4503-5559-9, S2CID 8111195

web.archive.org (Global: 1^st place; English: 1^st place)

Christofides, Nicos (1976), Worst-case analysis of a new heuristic for the travelling salesman problem (PDF), Report 388, Graduate School of Industrial Administration, CMU, archived (PDF) from the original on 2019-07-21. The handshaking lemma is cited at the top of page 2.

weizmann.ac.il (Global: 4,983^rd place; English: 8,002^nd place)

eccc.weizmann.ac.il

Chen, Xi; Deng, Xiaotie (2006), "Settling the complexity of two-player Nash equilibrium", Proc. 47th Symp. Foundations of Computer Science, pp. 261–271, doi:10.1109/FOCS.2006.69, ISBN 0-7695-2720-5, S2CID 14102058, ECCC TR05-140

Handshaking lemma (English Wikipedia)

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

mathscinet.ams.org

archive.org (Global: 6th place; English: 6th place)

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

books.google.com (Global: 3rd place; English: 3rd place)

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

dtic.mil (Global: 833rd place; English: 567th place)