Cover Image

Optimally building spanning graphs in semirandom graph processes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Anastos, Michael, Collares, Maurício, Erde, Joshua, Kang, Mihyun, Schmid, Dominik, Sorkin, Gregory B.
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Nearly spanning cycle in the percolated hypercube
by: Anastos, Michael, et al.
Published: (2025)

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

Large matchings and nearly spanning, nearly regular subgraphs of random subgraphs
by: Diskin, Sahar, et al.
Published: (2024)

Counting independent sets in expanding bipartite regular graphs
by: Collares, Maurício, et al.
Published: (2025)

A short proof of a central limit theorem for the order of the giant component and $k$-core
by: Anastos, Michael, et al.
Published: (2025)

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

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

Long cycles in percolated expanders
by: Collares, Maurício, et al.
Published: (2024)

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

A note on the width of sparse random graphs
by: Do, Tuan Anh, et al.
Published: (2022)

Perfect matchings and loose Hamilton cycles in the semirandom hypergraph model
by: Molloy, Michael, et al.
Published: (2023)

Isoperimetric Inequalities and Supercritical Percolation on High-dimensional Graphs
by: Diskin, Sahar, et al.
Published: (2023)

Percolation on High-dimensional Product Graphs
by: Diskin, Sahar, et al.
Published: (2022)

Percolation through Isoperimetry
by: Diskin, Sahar, et al.
Published: (2023)

Percolation on Irregular High-dimensional Product Graphs
by: Diskin, Sahar, et al.
Published: (2022)

Spanning trees of bounded degree in random geometric graphs
by: Anastos, Michael, et al.
Published: (2025)

On the number of spanning trees in random regular graphs
by: Greenhill, Catherine, et al.
Published: (2013)

Counting subgraphs in bounded-size Achlioptas processes
by: Kang, Mihyun, et al.
Published: (2026)

The evolution of the permutahedron
by: Collares, Maurício, et al.
Published: (2024)

Local limit of massive spanning forests on the complete graph
by: D'Achille, Matteo, et al.
Published: (2024)

Random minimum spanning tree and dense graph limits
by: Hladký, Jan, et al.
Published: (2023)

Anticoncentration of random spanning trees in almost regular graphs
by: Lee, Hyunwoo
Published: (2026)

Anticoncentration of random spanning trees in graphs with large minimum degree
by: Bitonti, Veronica, et al.
Published: (2026)

Catching a robber on a random $k$-uniform hypergraph
by: Erde, Joshua, et al.
Published: (2023)

The diameter of random spanning trees interpolating between the UST and the MST of the complete graph
by: Kúsz, Ágnes
Published: (2024)

Partitioning problems via random processes
by: Anastos, Michael, et al.
Published: (2023)

Optimal factor matchings for point processes on non-amenable unimodular graphs
by: Spinka, Yinon, et al.
Published: (2026)

Block-weighted random graphs: planar and beyond
by: Kang, Mihyun, et al.
Published: (2026)

The random graph process is globally synchronizing
by: Jain, Vishesh, et al.
Published: (2025)

The Moran process on a random graph
by: Frieze, Alan, et al.
Published: (2024)

The diameter of randomly twisted hypercubes
by: Aragão, Lucas, et al.
Published: (2023)

Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
by: Gamarnik, David, et al.
Published: (2023)

Optimal graph joining with applications to isomorphism detection and identification
by: Hoàng, Phuong N., et al.
Published: (2025)

The Gelfand-Tsetlin graph and Markov processes
by: Olshanski, Grigori
Published: (2014)

A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
by: Erde, Joshua, et al.
Published: (2019)

Robust Hamiltonicity in families of Dirac graphs
by: Anastos, Michael, et al.
Published: (2023)

A large hole in pseudo-random graphs
by: Diskin, Sahar, et al.
Published: (2025)

The completion numbers of Hamiltonicity and pancyclicity in random graphs
by: Alon, Yahav, et al.
Published: (2023)