Imagen de Portada

Refined Horton-Strahler numbers I: a discrete bijection

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Addario-Berry, Louigi, Albenque, Marie, Donderwinkel, Serte, Khanfir, Robin
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics Probability 05C05, 05A19, 05C30
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Random trees have height $O(\sqrt{n})$
por: Addario-Berry, Louigi, et al.
Publicado: (2022)

Critical trees are neither too short nor too fat
por: Addario-Berry, Louigi, et al.
Publicado: (2023)

Tight universal bounds on the height times the width of random trees
por: Donderwinkel, Serte, et al.
Publicado: (2024)

Fluctuations of the Horton-Strahler number of stable Galton-Watson trees
por: Khanfir, Robin
Publicado: (2024)

The number and structure of connected graphs with a fixed degree sequence
por: Bell, Sasha, et al.
Publicado: (2026)

To see the forest for the trees: On the infinite divisibility of unlabeled forests
por: Bassan, Michal, et al.
Publicado: (2025)

The Horton-Strahler number of Galton-Watson trees with possibly infinite variance
por: Khanfir, Robin
Publicado: (2023)

The largest common subtree of two random trees
por: Angel, Omer, et al.
Publicado: (2025)

Scaling limits of random graphs
por: Addario-Berry, Louigi, et al.
Publicado: (2024)

Universal diameter bounds for random graphs with given degrees
por: Addario-Berry, Louigi, et al.
Publicado: (2025)

Random friend trees
por: Berry, Louigi Addario, et al.
Publicado: (2024)

Tournament score sequences, Erdős-Ginzburg-Ziv numbers, and the Lévy-Khintchine method
por: Bassan, Michal, et al.
Publicado: (2024)

What is The Probability That A Random Graph With A Given Degree Sequence is Connected?
por: Addario-Berry, Louigi, et al.
Publicado: (2026)

The Horton-Strahler Number of Conditioned Galton-Watson Trees
por: Brandenberger, Anna M., et al.
Publicado: (2020)

Word length, bias and bijections in Penney's ante
por: Drexel, Mathew, et al.
Publicado: (2024)

Fibonacci and Lucas numbers arising from two-component spanning forests of wheel graphs
por: Miezaki, Tsuyoshi, et al.
Publicado: (2025)

The top eigenvalue of uniformly random trees
por: Addario-Berry, Louigi, et al.
Publicado: (2024)

Hurwitz numbers of a fixed partition (m, 1^{n-m}) via enumeration of unrooted hypermaps
por: Song, Yi
Publicado: (2026)

Cumulants in rectangular finite free probability and beta-deformed singular values
por: Cuenca, Cesar
Publicado: (2024)

Graphical sequences and plane trees
por: Bassan, Michal, et al.
Publicado: (2024)

A matrix for counting paths in acyclic colored digraphs
por: Bera, Sudip
Publicado: (2022)

Discrete snakes with globally centered displacements
por: Addario-Berry, Louigi, et al.
Publicado: (2025)

Parity patterns meet Genocchi numbers, I: four labelings and three bijections
por: Yuan, Quan, et al.
Publicado: (2025)

Asymptotics for the number of bipartite graphs with fixed surplus
por: Clancy Jr, David
Publicado: (2024)

Sinaĭ excursions: An analogue of Sparre Andersen's formula for the area process of a random walk
por: Donderwinkel, Serte, et al.
Publicado: (2024)

Bivariate asymptotics via random walks: application to large genus maps
por: Price, Andrew Elvey, et al.
Publicado: (2025)

Comparing the numbers of subforests and subgraph-degree-tuples
por: Shteiner, Sergei, et al.
Publicado: (2025)

A permutation based approach to the $q$-deformation of the Dynkin Operator
por: Grinberg, Darij, et al.
Publicado: (2025)

Counting Colored Trees
por: Dimitrov, Stoyan, et al.
Publicado: (2026)

Thron-type continued fractions (T-fractions) for some classes of increasing trees
por: Bitonti, Veronica, et al.
Publicado: (2024)

A bijection for the evolution of $B$-trees
por: Burghart, Fabian, et al.
Publicado: (2024)

A logarithmic bound for the chromatic number of the associahedron
por: Berry, Louigi Addario, et al.
Publicado: (2018)

Major Index Distribution
por: Coopman, Michael
Publicado: (2025)

Optimal root recovery for uniform attachment trees and $d$-regular growing trees
por: Addario-Berry, Louigi, et al.
Publicado: (2024)

On the enumeration of permutations avoiding chains of patterns
por: Zhou, Robin D. P., et al.
Publicado: (2024)

Difference ascent sequences and related combinatorial structures
por: Zang, Yongchun, et al.
Publicado: (2024)

Full asymptotic expansion for orbit-summable quadrant walks and discrete polyharmonic functions
por: Nessmann, Andreas
Publicado: (2023)

The distribution of the length of the longest path in random acyclic orientations of a complete bipartite graph
por: Khera, Jessica, et al.
Publicado: (2024)

The Defective Parking Space and Defective Kreweras Numbers
por: Garcia, Rebecca E., et al.
Publicado: (2024)

The inversion statistic in derangements and in other permutations with a prescribed number of fixed points
por: Pinsky, Ross G.
Publicado: (2025)