Discrete Mathematics and Combinatorics papers
Pofolia’s corpus holds 62 papers from Discrete Mathematics and Combinatorics (2012–2026), each with a short summary. Below, the 20 most-cited, then the most recently added.
At a glance
- Most cited: Extremal Graph Theory (2013, 1,695 citations).
- The 20 papers listed have 8,881 citations between them.
- 7 of the 9 with a known journal quartile appeared in a Q1 journal.
- 7 have a free full text (open access).
- Most frequent journals: Cambridge University Press eBooks, Annals of Mathematics, Discrete mathematics and its applications.
- Published between 2012 and 2024.
Most cited
Ranked by citation count. Because citations accumulate over time, this list naturally leans towards work published a few years ago; for where the field is now, see “recently added”. How to read the signals
Extremal Graph Theory
Discrete mathematics and its applications · 2013 · FWCI 91.59 · 1,695 citations
This volume offers a concise yet comprehensive treatment of extremal graph theory, featuring complete proofs for nearly all results and numerous exercises.
Theory of Groups of Finite Order
Cambridge University Press eBooks · 2012 · FWCI 15.49 · 1,071 citations
This is a reissue of the 1911 second edition of William Burnside's foundational textbook on the theory of finite groups, which includes Frobenius's character theory.
Combinatorial Enumeration
Cambridge University Press eBooks · 2024 · FWCI 67.30 · 980 citations
A summary is not available for this content, and no preview was provided.
Modelling using Polynomial Regression
Procedia Engineering · 2012 · 777 citations
This paper applies polynomial regression to model the curvilinear relationship between strains and drilling depth, estimating parameters with a least squares method.
Introduction to Random Graphs
Cambridge University Press eBooks · 2015 · FWCI 5.50 · 582 citations
This book offers a gentle introduction to the theory of random graphs, providing a framework for understanding the structure and development of complex networks.
The Maximal Subgroups of the Low-Dimensional Finite Classical Groups
Cambridge University Press eBooks · 2013 · FWCI 14.29 · 542 citations
This book provides a comprehensive classification of maximal subgroups within low-dimensional finite classical and exceptional groups, presenting over 80 tables of previously unseen results.
Combinatorics of Permutations
2022 · FWCI 8.63 · 422 citations
The third edition of 'Combinatorics of Permutations' updates a leading textbook with significant advancements in pattern avoidance and analytic combinatorics.
Independent sets in hypergraphs
Journal of the American Mathematical Society · 2014 · Q1 · SJR 7.00 · FWCI 58.36 · 344 citations · Open access
A new, distinct approach to proving extremal and structural results in sparse random hypergraphs is introduced, yielding 'counting' versions of these theorems.
Convergent sequences of dense graphs II. Multiway cuts and statistical physics
Annals of Mathematics · 2012 · Q1 · SJR 9.00 · FWCI 28.30 · 317 citations · Open access
This paper introduces and formalizes two new notions of graph convergence: 'left-convergence' and 'right-convergence', based on homomorphism densities into sequences of dense graphs.
Topological Graph Theory
Discrete mathematics and its applications · 2013 · FWCI 18.35 · 256 citations
This paper proves that in a tournament with 799 teams where every pair plays once, there must exist two disjoint groups of 7 teams each (A and B) where every team in A defeated every team in B.
The quantitative behaviour of polynomial orbits on nilmanifolds
Annals of Mathematics · 2012 · Q1 · SJR 9.00 · FWCI 26.15 · 217 citations · Open access
This paper provides a quantitative description of how polynomial orbits on nilmanifolds become uniformly distributed, refining Leibman's theorem.
Combinatorial Hopf algebras and generalized DehnSommerville relations
2012 · 217 citations
Researchers introduce the concept of a combinatorial Hopf algebra, a structure with a character mapping to a field, and demonstrate that the algebra of quasi-symmetric functions is the universal example.
Unipotent and Nilpotent Classes in Simple Algebraic Groups and Lie Algebras
Mathematical surveys and monographs · 2012 · FWCI 4.96 · 209 citations
This book provides the first comprehensive compilation of information on class representatives and centralizers of unipotent and nilpotent elements in simple algebraic groups and Lie algebras across all field characteristics.
Groups of Prime Power Order 4
2015 · FWCI 3.21 · 209 citations
This abstract describes the fourth volume of a comprehensive, elementary treatment of finite p-group theory, focusing on minimal nonabelian p-groups and their subgroup structures.
Power graphs: A survey
Electronic Journal of Graph Theory and Applications · 2013 · Q2 · FWCI 20.07 · 196 citations · Open access
This survey consolidates existing research on power graphs of groups and semigroups, presenting a comprehensive overview of the field.
Combinatorial theorems in sparse random sets
Annals of Mathematics · 2016 · Q1 · SJR 9.00 · FWCI 46.39 · 179 citations
A new technique unifies proofs showing that major combinatorial theorems, like Turán's and Ramsey's, hold true in sparse random sets.
An independent set degree condition for fractional critical deleted graphs
Discrete and Continuous Dynamical Systems - S · 2018 · Q2 · FWCI 88.23 · 171 citations
This paper establishes a new degree condition for a graph to be a fractional critical deleted graph, specifically when the maximum degree of any independent set of size $i$ meets a certain threshold.
Positroid varieties: juggling and geometry
Compositio Mathematica · 2013 · Q1 · SJR 2.00 · FWCI 29.73 · 170 citations · Open access
Researchers introduce 'positroid varieties' by intersecting cyclic shifts of a single Bruhat decomposition, revealing hidden cyclic-invariance and connecting to geometric structures.
On sets of vectors of a finite vector space in which every subset of basis size is a basis
Journal of the European Mathematical Society · 2012 · Q1 · SJR 3.00 · FWCI 11.69 · 168 citations · Open access
A finite vector space's maximum set size where any k vectors form a basis is proven to be at most q+1 (for k <= p) or q+k-p (for q >= k >= p+1 >= 4).
On the Bogolyubov–Ruzsa lemma
Analysis & PDE · 2012 · Q1 · SJR 2.00 · FWCI 20.79 · 159 citations · Open access
A new bound shows that for any finite subset A of an abelian group, 2A 2A contains a structured set (a coset progression) of significant size, specifically at least exp(O(log(1/K)))|A|, where K relates to the size of A+A.
Recently added
Singular Hodge theory for combinatorial geometries
Journal of the American Mathematical Society · 2026 · Q1 · SJR 7.00 · 30 citations · Open access
A new intersection cohomology module for matroids is introduced, proving it satisfies Poincaré duality, hard Lefschetz, and Hodge-Riemann relations.
Lattice Structure for Orientations of Graphs
The Electronic Journal of Combinatorics · 2025 · Q1 · FWCI 2.76 · 74 citations · Open access
The set of graph orientations with identical flow-differences around closed loops can be structured as a distributive lattice.
Combinatorial Enumeration
Cambridge University Press eBooks · 2024 · FWCI 67.30 · 980 citations
A summary is not available for this content, and no preview was provided.
Combinatorics of Permutations
2022 · FWCI 8.63 · 422 citations
The third edition of 'Combinatorics of Permutations' updates a leading textbook with significant advancements in pattern avoidance and analytic combinatorics.
Artificial intelligence as a general-purpose technology: an historical perspective
Oxford Review of Economic Policy · 2021 · Q2 · FWCI 43.84 · 137 citations
Artificial intelligence (AI) may drive a Fourth Industrial Revolution by increasing the productivity of research and development, similar to how steam and electricity spurred previous industrial revolutions.
Lorentzian polynomials
Annals of Mathematics · 2020 · Q1 · SJR 9.00 · FWCI 33.82 · 123 citations
A new class of polynomials, termed Lorentzian, is introduced, characterized by their Hessian having exactly one positive eigenvalue on the positive orthant, analogous to Hodge-Riemann relations.
A survey of χ‐boundedness
Journal of Graph Theory · 2020 · Q1 · SJR 1.00 · FWCI 43.76 · 140 citations
This survey details recent progress on András Gyárfás's conjectures regarding the relationship between a graph's clique number, chromatic number, and its induced subgraphs.
Jensen polynomials for the Riemann zeta function and other sequences
Proceedings of the National Academy of Sciences · 2019 · Q1 · SJR 3.00 · FWCI 28.77 · 115 citations · Open access
Jensen polynomials for the Riemann zeta function are hyperbolic for all but finitely many degrees, proving a key conjecture and a prediction from random matrix theory.
Journals in this field
The journals that publish most of this field’s papers. Quartile (Q1–Q4), SJR and h-index are from SCImago Journal Rank; “in this field” is how many of the journal’s pooled papers belong here. What is a Q1 journal? · What is the h-index?
| Journal | Quartile | SJR | h-index | In this field | Summaries |
|---|---|---|---|---|---|
| Annals of Mathematics | Q1 | 9.00 | 153 | 9 | 25 |
| Journal of the American Mathematical Society | Q1 | 7.00 | 120 | 3 | 6 |
| Duke Mathematical Journal | Q1 | 4.00 | 105 | 2 | 5 |
| Transactions of the American Mathematical Society | Q1 | 1.00 | 114 | 2 | 5 |
| Advanced Studies in Pure Mathematics | Q3 | — | 7 | 2 | 8 |
| Acta Mathematica | Q1 | 8.00 | 85 | 1 | 3 |
| Proceedings of the National Academy of Sciences of the United States of America | Q1 | 3.00 | 929 | 1 | 110 |
| Journal of the European Mathematical Society | Q1 | 3.00 | 73 | 1 | 4 |
Every journal in Discrete Mathematics and Combinatorics (Q1–Q4) →
Add this field to your daily feed
Pick your interests and new work in your area arrives every day, summarised. Full summaries live in the app.
Open the appOther subfields in Mathematics
- Algebra and Number Theory
- Geometry and Topology
- Computational Mathematics
- Statistics and Probability
- Mathematical Physics
- Modeling and Simulation
- Numerical Analysis
- Theoretical Computer Science
- Applied Mathematics