Combinatorial Proof Techniques
Combinatorial Proof Techniques is a systematic method in discrete mathematics that establishes mathematical truths by counting or analyzing finite structures in two distinct ways to demonstrate equality or derive conclusions, particularly leveraging bijective and constructive reasoning within combinatorial arguments.
171
Publications
8.4K
Citations
237
Authors
163
Institutions
Publications per year
2017–2026
16
Parents
171
Khovanov homology and the slice genus
Jacob Rasmussen · Inventiones mathematicae · 2010 · 512 citations
Daniel J. Kleitman, Ian Anderson · American Mathematical Monthly · 1989 · 478 citations
A constructive proof of the general lovász local lemma
Robin A. Moser, Gábor Tardos · Journal of the ACM · 2010 · 468 citations
Combinatorics: topics, techniques, algorithms
Choice Reviews Online · 1995 · 456 citations
Proof Techniques in Graph Theory
N. J. A. Sloane, Frank Harary · Mathematics of Computation · 1970 · 385 citations
1–5 of 171
237
5
h-index
4
h-index
4
h-index
3
h-index
2
h-index
1–5 of 237
163

Pennsylvania State University
State College, United States
5 h-index
7 publications
148 citations

Weizmann Institute of Science
Rehovot, Israel
5 h-index
6 publications
146 citations

Brandeis University
Waltham, United States
5 h-index
8 publications
351 citations
Stanford University
Stanford, United States
5 h-index
7 publications
766 citations

Centre National de la Recherche Scientifique
Paris, France
5 h-index
10 publications
390 citations
IIT@MIT
Cambridge, United States
4 h-index
6 publications
138 citations
University of California, Berkeley
Berkeley, United States
4 h-index
4 publications
159 citations

Cornell University
Ithaca, United States
4 h-index
5 publications
212 citations
1–8 of 163
22 publications · 590 citations
15
h-index
11 publications · 459 citations
11
h-index
8 publications · 269 citations
8
h-index
Repository · 6 publications · 178 citations
6
h-index
PROC · 6 publications · 122 citations
6
h-index
1–5