Miklós Bóna

University of Florida — United States

Mathematics · Physical Sciences

25h-index2.7kcitations191works0.22yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Combinatorial Mathematics(105), Advanced Mathematical Identities(44), graph theory and CDMA systems(36), semigroups and automata theory(28), Algorithms and Data Compression(25)

Publications189 total

Permutations with restricted cycle lengths
Algebraic Combinatorics·2025Open Access
A Combinatorial Proof of a Symmetry for a Refinement of the Narayana Numbers
The Electronic Journal of Combinatorics·2025Open Access
Correction to: The Likely Maximum Size of Twin Subtrees in a Large Random Tree
Annals of Combinatorics·2025Open Access
On the intersection of pairs of trees
arXiv (Cornell University)·2025Open Access
Counting magic squares and magic cubes
2025
Introduction to Enumerative and Analytic Combinatorics
2025
Analytic combinatorics
2025· 3 cited
Sequences in combinatorics
2025
Extremal combinatorics
2025
Mini-Workshop: Permutation Patterns
Oberwolfach Reports·2024Open Access
Long increasing subsequences and non-algebraicity
Discrete Mathematics & Theoretical Computer Science·2024Open Access
The Likely Maximum Size of Twin Subtrees in a Large Random Tree
Annals of Combinatorics·2024
Counting pairs of cycles whose product is a permutation with restricted cycle lengths
arXiv (Cornell University)·2024Open Access
The likely maximum size of twin subtrees in a large random tree
arXiv (Cornell University)·2023Open Access
The Endomorphism Conjecture for Graded Posets with Whitney Numbers at most 4
Studia Scientiarum Mathematicarum Hungarica·2023
A Walk Through Combinatorics
WORLD SCIENTIFIC eBooks·2023· 4 cited
Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves
Random Structures and Algorithms·2022
A combinatorial proof of a symmetry for a refinement of the Narayana numbers
arXiv (Cornell University)·2022· 2 citedOpen Access
Permutations avoiding sets of patterns with long monotone subsequences
Journal of Symbolic Computation·2022· 4 cited
On a random search tree: asymptotic enumeration of vertices by distance from leaves – CORRIGENDUM
Advances in Applied Probability·2022· 1 citedOpen Access
page 1 of 10Next →

Frequent Co-authors

Bruce E. Sagan(2), Vincent Vatter(2), Hyeong-Kwan Ju(2), Michel Bousquet(1), Gilbert Labelle(1), Pierre Leroux(1), Daniel A. Spielman(1), Richard Ehrenborg(1), Ryan Flynn(1), Philippe Flajolet(1), Arnold Knopfmacher(1), István Mező(1), Meera Sitharam(1), Andrew Vince(1), Cheyne Homberger(1), Jay Pantone(1), Ruriko Yoshida(1), Rodica Simion(1)