Imagen de Portada

Slow graph bootstrap percolation I: Cycles

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Fabian, David, Morris, Patrick, Szabó, Tibor
Formato:	Preprint
Publicado:	2023
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Slow graph bootstrap percolation II: Accelerating properties
por: Fabian, David, et al.
Publicado: (2023)

Slow graph bootstrap percolation III: Chain constructions
por: Fabian, David, et al.
Publicado: (2025)

Graph bootstrap percolation -- a discovery of slowness
por: Fabian, David, et al.
Publicado: (2026)

Large deviations for subcritical bootstrap percolation on the random graph
por: Angel, Omer, et al.
Publicado: (2017)

On almost Gallai colourings in complete graphs
por: Grebennikov, Alexandr, et al.
Publicado: (2025)

Universal behaviour of majority bootstrap percolation on high-dimensional geometric graphs
por: Collares, Maurício, et al.
Publicado: (2024)

Upper bounds on the running time of bootstrap percolation
por: Liu, Weichan, et al.
Publicado: (2026)

Global rigidity of random graphs in $\mathbb{R}$
por: Montgomery, Richard, et al.
Publicado: (2024)

Improved bounds for the minimum degree of minimal multicolor Ramsey graphs
por: Attwa, Yamaan, et al.
Publicado: (2025)

Almost-perfect colorful matchings in three-edge-colored bipartite graphs
por: Boyadzhiyska, Simona, et al.
Publicado: (2025)

Majority bootstrap percolation on the permutahedron and other high-dimensional graphs
por: Collares, Maurício, et al.
Publicado: (2025)

The critical activation density in graph bootstrap percolation
por: Kolesnik, Brett, et al.
Publicado: (2026)

Using polynomials to find lower bounds for $r$-bond bootstrap percolation
por: Morrison, Natasha, et al.
Publicado: (2024)

On polluted bootstrap percolation in Cartesian grids
por: Brešar, Boštjan, et al.
Publicado: (2025)

The maximum diameter of 2-dimensional simplicial complexes
por: Parczyk, Olaf, et al.
Publicado: (2025)

Cycle lengths in the percolated hypercube
por: Anastos, Michael, et al.
Publicado: (2025)

Sharp Fuss-Catalan thresholds in graph bootstrap percolation
por: Bartha, Zsolt, et al.
Publicado: (2025)

Bootstrap percolation on the Hamming graphs
por: Miralaei, Meysam, et al.
Publicado: (2024)

On the number of sets with small sumset
por: Liu, Dingyuan, et al.
Publicado: (2024)

The maximum diameter of $d$-dimensional simplicial complexes
por: Glock, Stefan, et al.
Publicado: (2026)

The maximal running time of hypergraph bootstrap percolation
por: Hartarsky, Ivailo, et al.
Publicado: (2022)

Explosive appearance of cores and bootstrap percolation on lattices
por: Hartarsky, Ivailo, et al.
Publicado: (2025)

Minimally globally rigid graphs
por: Garamvölgyi, Dániel, et al.
Publicado: (2022)

Components, large and small, are as they should be I: supercritical percolation on regular graphs of growing degree
por: Diskin, Sahar, et al.
Publicado: (2024)

Count and cofactor matroids of highly connected graphs
por: Garamvölgyi, Dániel, et al.
Publicado: (2022)

Supercritical percolation on finite transitive graphs I: Uniqueness of the giant component
por: Easo, Philip, et al.
Publicado: (2021)

A cube dismantling problem related to bootstrap percolation
por: Barát, János, et al.
Publicado: (2026)

Universality of the matching number in percolated regular graphs
por: Diskin, Sahar, et al.
Publicado: (2025)

Partial reflections and globally linked pairs in rigid graphs
por: Garamvölgyi, Dániel, et al.
Publicado: (2023)

A note on multicolour Ramsey numbers and random sphere graphs
por: Attwa, Yamaan, et al.
Publicado: (2026)

Counting independent sets in percolated graphs via the Ising model
por: Geisler, Anna, et al.
Publicado: (2025)

Finding long cycles in a percolated expander graphs
por: Hollom, Lawrence
Publicado: (2025)

Color-avoiding percolation on the Erdős-Rényi random graph
por: Lichev, Lyuben, et al.
Publicado: (2022)

Characterizing globally linked pairs in graphs
por: Jordán, Tibor, et al.
Publicado: (2026)

Sufficient conditions for bipartite rigidity, symmetric completability and hyperconnectivity of graphs
por: Garamvölgyi, Dániel, et al.
Publicado: (2025)

Globally rigid graphs are fully reconstructible
por: Garamvölgyi, Dániel, et al.
Publicado: (2021)

A canonical Ramsey theorem for even cycles in random graphs
por: Alvarado, José D., et al.
Publicado: (2024)

A canonical Ramsey theorem with list constraints in random (hyper-)graphs
por: Alvarado, José D., et al.
Publicado: (2023)

Bootstrap percolation on the high-dimensional Hamming graph
por: Kang, Mihyun, et al.
Publicado: (2024)

Spread-out percolation on transitive graphs of polynomial growth
por: Spanos, Panagiotis, et al.
Publicado: (2024)