Keyword

combinatorial proof

Description: A combinatorial proof establishes a mathematical result by counting or relating discrete structures, often using bijections or double counting.
Wikidata ID: wiki/Q3402784
OpenAlex ID: keywords/combinatorial-proof
1974 · C. Becchi, A. Rouet, et al. · Physics Letters B · 859
1972 · G. 't Hooft, M. Veltman · Nuclear Physics B · 506
1982 · Seth Chaiken · SIAM Journal on Algebraic and Discrete Methods · 359
2007 · William Gowers · Annals of Mathematics · 358
1966 · D. Lubell · Journal of Combinatorial Theory · 316
1982 · Laurie Kirby, Jeff Paris · Bulletin of the London Mathematical Society · 282
1995 · Doron Zeilberger · The Electronic Journal of Combinatorics · 271
2013 · Discrete mathematics and its applications · 250
2003 · Arthur Benjamin, Jennifer Quinn · American Mathematical Society eBooks · 238
1978 · Curtis Greene, Daniel J. Kleitman · 192
1972 · Edward A Bender, Donald E Knuth · Journal of Combinatorial Theory Series A · 185
2011 · Stasys Jukna · Texts in theoretical computer science · 162
1990 · J. A. Bondy, Pavol Hell · Journal of Graph Theory · 153
2008 · Abdelmalek Abdesselam, Vincent Rivasseau · Springer eBooks · 128
2004 · Jiří Matoušek · COMBINATORICA · 119
2004 · Martin Dyer, Alistair Sinclair, et al. · Random Structures and Algorithms · 113
1999 · Dominique Foata, Doron Zeilberger · Transactions of the American Mathematical Society · 100
1987 · Ira M Gessel · Journal of Combinatorial Theory Series A · 99
1998 · Jonathan M. Borwein, David M. Bradley, et al. · The Electronic Journal of Combinatorics · 97
1981 · Gilbert Labelle · Advances in Mathematics · 97
1929 · G. N. Watson · Journal of the London Mathematical Society · 96
Works count: 2,644
Citation count: 18,410
Year
Topic
Type