:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Arizmendi, Octavio, Gurrola-Viramontes, Samuel
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics 05C60, 05C80
Accès en ligne:	https://arxiv.org/abs/2502.01065
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Universal diameter bounds for random graphs with given degrees
par: Addario-Berry, Louigi, et autres
Publié: (2025)

The number and structure of connected graphs with a fixed degree sequence
par: Bell, Sasha, et autres
Publié: (2026)

Infinite random graphs
par: Kostana, Ziemowit, et autres
Publié: (2026)

Scaling limits of random graphs
par: Addario-Berry, Louigi, et autres
Publié: (2024)

Majority dynamics on sparse random graphs
par: Chakraborti, Debsoumya, et autres
Publié: (2021)

Limits of chordal graphs with bounded tree-width
par: Castellví, Jordi, et autres
Publié: (2023)

Isomorphisms between dense random graphs
par: Surya, Erlang, et autres
Publié: (2023)

The sharp threshold for jigsaw percolation in random graphs
par: Cooley, Oliver, et autres
Publié: (2018)

Almost all graphs have no cospectral mate with fixed level
par: Wang, Wei, et autres
Publié: (2025)

Upper tail bounds for irregular graphs
par: Basak, Anirban, et autres
Publié: (2025)

On the upper tail of star counts in random graphs
par: Akhmejanova, Margarita, et autres
Publié: (2025)

Upper tails of subgraph counts in directed random graphs
par: Park, Jiyun
Publié: (2024)

The largest subcritical component in inhomogeneous random graphs of preferential attachment type
par: Mörters, Peter, et autres
Publié: (2025)

Extreme local statistics in random graphs: maximum tree extension counts
par: Araújo, Pedro, et autres
Publié: (2023)

The Horton-Strahler Number of Conditioned Galton-Watson Trees
par: Brandenberger, Anna M., et autres
Publié: (2020)

Asymptotic normality for general subtree counts in conditioned Galton--Watson trees
par: Rakotoniaina, Fameno, et autres
Publié: (2026)

Central limit theorem for crossings in randomly embedded graphs
par: Arenas-Velilla, Santiago, et autres
Publié: (2023)

The law of the circumference of sparse binomial random graphs
par: Anastos, Michael, et autres
Publié: (2025)

On the jump of the cover time in random geometric graphs
par: Martinez, Carlos, et autres
Publié: (2025)

The largest common subtree of two random trees
par: Angel, Omer, et autres
Publié: (2025)

Normal approximation for number of edges in random intersection graphs
par: Rybarczyk, Katarzyna, et autres
Publié: (2025)

Tripodal structure in undersaturated random graphs
par: DiCarlo, William, et autres
Publié: (2025)

Sharp Fuss-Catalan thresholds in graph bootstrap percolation
par: Bartha, Zsolt, et autres
Publié: (2025)

On the concentration of the chromatic number of random graphs
par: Surya, Erlang, et autres
Publié: (2022)

Tight universal bounds on the height times the width of random trees
par: Donderwinkel, Serte, et autres
Publié: (2024)

Critical trees are neither too short nor too fat
par: Addario-Berry, Louigi, et autres
Publié: (2023)

The clique chromatic number of sparse random graphs
par: Fernandez V, Manuel, et autres
Publié: (2024)

On the evolution of random integer compositions
par: Bevan, David, et autres
Publié: (2023)

Modularity and random graphs
par: McDiarmid, Colin, et autres
Publié: (2025)

Large Components and Trees of Random Mappings
par: Mutafchiev, Ljuben, et autres
Publié: (2025)

On the Deepest Cycle of a Random Mapping
par: Mutafchiev, Ljuben, et autres
Publié: (2023)

A note on Two-Point Concentration of the Independence Number of $G_{n,m}$
par: Bohman, Tom, et autres
Publié: (2024)

What is The Probability That A Random Graph With A Given Degree Sequence is Connected?
par: Addario-Berry, Louigi, et autres
Publié: (2026)

Random intersection graphs with communities
par: van der Hofstad, Remco, et autres
Publié: (2018)

Monochromatic Subgraphs in Randomly Colored Dense Multiplex Networks
par: Andrade, Mauricio Daros, et autres
Publié: (2025)

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

Maximising homomorphism counts between digraphs
par: Lüchtrath, Lukas, et autres
Publié: (2026)

On the thresholds of degenerate hypergraphs
par: Chen, Yu, et autres
Publié: (2024)

Robustness of the Sauer-Spencer Theorem
par: Allen, Peter, et autres
Publié: (2025)

Subgraphs in random graphs with specified degrees and forbidden edges
par: Larkin, John, et autres
Publié: (2025)