Keyword

counting lemma

Description: A counting lemma is a result in combinatorics that estimates or counts configurations in structures such as graphs or matrices under specified conditions.
Wikidata ID: wiki/Q111950818
OpenAlex ID: keywords/counting-lemma
2007 · William Gowers · Annals of Mathematics · 451
2006 · Brendan Nagle, Vojtěch Rödl, et al. · Random Structures and Algorithms · 247
· Brendan Nagle, Vojtech Rödl, et al. · 203
2006 · W. T. GOWERS · Combinatorics Probability Computing · 201
2006 · Terence Tao · Journal of Combinatorial Theory Series A · 199
2012 · Gábor Elek, Balázs Szegedy · Advances in Mathematics · 123
2009 · Yoshiharu Kohayakawa, Brendan Nagle, et al. · Journal of Combinatorial Theory Series B · 108
2005 · Stefanie Gerke, Angelika Steger · Cambridge University Press eBooks · 89
2020 · Nicholas Cook, Amir Dembo · Advances in Mathematics · 81
2014 · David Conlon, Jacob Fox, et al. · Advances in Mathematics · 71
2007 · VOJTĚCH RÖDL, MATHIAS SCHACHT · Combinatorics Probability Computing · 71
2005 · V. Rödl, B. Nagle, et al. · Proceedings of the National Academy of Sciences · 59
2007 · Brendan Nagle, Vojtěch Rödl, et al. · Springer eBooks · 51
2004 · Boris Mityagin · Dynamics of Partial Differential Equations · 50
2003 · Brendan Nagle, Vojtěch Rödl · Random Structures and Algorithms · 43
2002 · Yoshiharu Kohayakawa, Brendan Nagle, et al. · Lecture notes in computer science · 31
2021 · David Conlon, Jacob Fox, et al. · Journal of the London Mathematical Society · 28
2009 · Brendan Nagle, Annika Poerschket, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 28
2024 · Nicholas A. Cook, Amir Dembo, et al. · Duke Mathematical Journal · 24
2008 · Peter Keevash · Random Structures and Algorithms · 24
2010 · Green, Ben, Tao, Terence · arXiv (Cornell University) · 22
2005 · P.E. Haxell, B. Nagle, et al. · Annual Symposium on Foundations of Computer Science · 20
2015 · Terence Tao · Collectanea mathematica · 19
2005 · Vojtĕch Rödl, Jozef Skokan · Random Structures and Algorithms · 18
2009 · Brendan Nagle, Annika Poerschke, et al. · Symposium on Discrete Algorithms · 15
Works count: 89
Citation count: 2,501
Year
Topic
Type