:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Bevan, David, Threlfall, Dan
Formato:	Preprint
Publicado:	2023
Materias:	Combinatorics 60C05, 05A05, 05C80
Acceso en línea:	https://arxiv.org/abs/2309.06287
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Thresholds for patterns in random permutations with a given number of inversions
por: Bevan, David, et al.
Publicado: (2023)

Asymptotic height of Plancherel random trees
por: Zhang, Shengjun
Publicado: (2026)

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

Trees with flowers: A catalog of integer partition and integer composition trees with their asymptotic analysis
por: Aíza, Ricardo Gómez
Publicado: (2024)

Infinite random graphs
por: Kostana, Ziemowit, et al.
Publicado: (2026)

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

On likelihood of a Condorcet winner for uniformly random and independent voter preferences
por: Pittel, Boris
Publicado: (2025)

Isomorphisms between dense random graphs
por: Surya, Erlang, et al.
Publicado: (2023)

Isomorphisms between random $d$-hypergraphs
por: Lenoir, Théo
Publicado: (2024)

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

Majority dynamics on sparse random graphs
por: Chakraborti, Debsoumya, et al.
Publicado: (2021)

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

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

Asymptotic normality for general subtree counts in conditioned Galton--Watson trees
por: Rakotoniaina, Fameno, et al.
Publicado: (2026)

The sharp threshold for jigsaw percolation in random graphs
por: Cooley, Oliver, et al.
Publicado: (2018)

Tripodal structure in undersaturated random graphs
por: DiCarlo, William, et al.
Publicado: (2025)

Upper tails of subgraph counts in directed random graphs
por: Park, Jiyun
Publicado: (2024)

The law of the circumference of sparse binomial random graphs
por: Anastos, Michael, et al.
Publicado: (2025)

On the jump of the cover time in random geometric graphs
por: Martinez, Carlos, et al.
Publicado: (2025)

Normal approximation for subgraph count in random hypergraphs
por: Michalczuk, Wojciech, et al.
Publicado: (2024)

Normal approximation for number of edges in random intersection graphs
por: Rybarczyk, Katarzyna, et al.
Publicado: (2025)

A tail bound for cumulant series for complex functions of independent random variables
por: Isaev, Mikhail
Publicado: (2025)

Bound for the energy of graphs in terms of degrees and leaves
por: Arizmendi, Octavio, et al.
Publicado: (2025)

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

Monochromatic Subgraphs in Randomly Colored Dense Multiplex Networks
por: Andrade, Mauricio Daros, et al.
Publicado: (2025)

On the concentration of the chromatic number of random graphs
por: Surya, Erlang, et al.
Publicado: (2022)

On the upper tail of star counts in random graphs
por: Akhmejanova, Margarita, et al.
Publicado: (2025)

The clique chromatic number of sparse random graphs
por: Fernandez V, Manuel, et al.
Publicado: (2024)

The spread of fire on a random multigraph
por: Goldschmidt, Christina, et al.
Publicado: (2017)

Extreme local statistics in random graphs: maximum tree extension counts
por: Araújo, Pedro, et al.
Publicado: (2023)

Robustness of the Sauer-Spencer Theorem
por: Allen, Peter, et al.
Publicado: (2025)

Almost all graphs have no cospectral mate with fixed level
por: Wang, Wei, et al.
Publicado: (2025)

Maximising homomorphism counts between digraphs
por: Lüchtrath, Lukas, et al.
Publicado: (2026)

On the thresholds of degenerate hypergraphs
por: Chen, Yu, et al.
Publicado: (2024)

The distance to the border of a random tree
por: Maciá, Víctor J.
Publicado: (2022)

The largest subcritical component in inhomogeneous random graphs of preferential attachment type
por: Mörters, Peter, et al.
Publicado: (2025)

$H$-percolation with a random $H$
por: Bartha, Zsolt, et al.
Publicado: (2023)

On the Deepest Cycle of a Random Mapping
por: Mutafchiev, Ljuben, et al.
Publicado: (2023)

Limits of chordal graphs with bounded tree-width
por: Castellví, Jordi, et al.
Publicado: (2023)

Large Components and Trees of Random Mappings
por: Mutafchiev, Ljuben, et al.
Publicado: (2025)