Enumeration of Combinatorial Classes is a foundational method in enumerative combinatorics that systematically assigns generating functions to combinatorial structures in order to count and analyze the number of objects of each size within a given class.
228
Publications
11.3K
Citations
308
Authors
179
Institutions
Publications per year
2017–2026
14
Parents
Publications
228
Introduction to Combinatorial Mathematics.
J. W. Moon, George B. Dantzig, C. L. Liu · American Mathematical Monthly · 1971 · 617 citations
FA Dick de Bruijn, P. Erdös · 1948 · 406 citations
Applied Combinatorics on Words
M. Lothaire · Cambridge University Press eBooks · 2005 · 400 citations
1–5 of 228
Authors
308
- SF
13
h-index
- SR
4
h-index
- AF
4
h-index
- PD
3
h-index
- PJ
3
h-index
1–5 of 308
Institutions
179
Centre National de la Recherche Scientifique
Paris, France
12 h-index
23 publications
713 citations
Kyoto Institute of Technology
Kyoto, Japan
10 h-index
12 publications
223 citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
8 h-index
9 publications
724 citations
Sorbonne Université
Paris, France
5 h-index
11 publications
273 citations
Laboratoire de Physique Théorique de la Matière Condensée
Paris, France
4 h-index
9 publications
241 citations
Institute of Nuclear Physics, Polish Academy of Sciences
Krakow, Poland
4 h-index
5 publications
131 citations
Université de Bordeaux
Bordeaux, France
4 h-index
5 publications
549 citations
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
5 publications
196 citations
1–8 of 179
Venues
- The Electronic Journal of Combinatorics
16 publications · 600 citations
14
h-index
- Discrete Mathematics
10 publications · 681 citations
10
h-index
- Journal of Combinatorial Theory Series A
7 publications · 396 citations
7
h-index
- Bulletin of the London Mathematical Society
7 publications · 704 citations
7
h-index
- Theoretical Chemistry Accounts
7 publications · 167 citations
7
h-index
1–5