Cover Image

Spread blow-up lemma with an application to perturbed random graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nenadov, Rajko, Pham, Huy Tuan
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Discrete Mathematics Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A sharp version of Talagrand's selector process conjecture and an application to rounding fractional covers
by: Pham, Huy Tuan
Published: (2024)

On the clique number of random Cayley graphs and related topics
by: Conlon, David, et al.
Published: (2024)

Sunflowers in set systems with small VC-dimension
by: Balogh, József, et al.
Published: (2024)

Shotgun assembly of random graphs
by: Johnston, Tom, et al.
Published: (2022)

Canonical labelling of random regular graphs
by: Isaev, Mikhail, et al.
Published: (2026)

Minimum stationary values of sparse random directed graphs
by: Cai, Xing Shi, et al.
Published: (2020)

Speeding up random walk mixing by starting from a uniform vertex
by: Díaz, Alberto Espuny, et al.
Published: (2022)

The largest subgraph without a forbidden induced subgraph
by: Fox, Jacob, et al.
Published: (2024)

Independent transversal blow-up of graphs
by: Dai, Tianjiao, et al.
Published: (2025)

Hypergraph universality via branching random walks
by: Nenadov, Rajko
Published: (2024)

A multipartite analogue of Dilworth's Theorem
by: Fox, Jacob, et al.
Published: (2024)

A binomial random multigraph
by: Pelekis, Christos
Published: (2023)

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

The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes
by: Tiskin, Alexander
Published: (2022)

On Graham's rearrangement conjecture
by: Pham, Huy Tuan, et al.
Published: (2026)

Limit Laws for Critical Dispersion on Complete Graphs
by: De Ambroggio, Umberto, et al.
Published: (2024)

Record-biased permutations and their permuton limit
by: Bouvel, Mathilde, et al.
Published: (2024)

Asymptotic Bounds and Online Algorithms for Average-Case Matrix Discrepancy
by: Kunisky, Dmitriy, et al.
Published: (2024)

On the Asymptotics of the Connectivity Probability of Random Bipartite Graphs
by: Chinyaev, Boris
Published: (2025)

A threshold for online balancing of sparse i.i.d. vectors
by: Altschuler, Dylan J., et al.
Published: (2025)

From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP
by: Gurvits, Leonid, et al.
Published: (2023)

Zero-One Laws for Random Feasibility Problems
by: Altschuler, Dylan J.
Published: (2023)

Infinite Schnyder Woods
by: Addario-Berry, Louigi, et al.
Published: (2025)

Expected Length of the Longest Common Subsequence of Multiple Strings
by: Li, Ray, et al.
Published: (2025)

Approximate polymorphisms of predicates
by: Alekseev, Yaroslav, et al.
Published: (2025)

A Proof of Talagrand's Creating Large Sets Conjecture
by: Fang, Xuan, et al.
Published: (2025)

Counterexamples to an Extremal Conjecture for Random Cycle-Factors
by: Gajjala, Rishikesh
Published: (2026)

A lower bound on the spectrum of unimodular networks
by: Rahman, Mustazee
Published: (2016)

Random 0/1-polytopes expand rapidly
by: Guo, He, et al.
Published: (2026)

Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees
by: Bencs, Ferenc, et al.
Published: (2023)

Cutoff profile of the Metropolis biased card shuffling
by: Zhang, Lingfu
Published: (2022)

Reachability in temporal graphs under perturbation
by: Enright, Jessica, et al.
Published: (2024)

Cycle-factors of regular graphs via entropy
by: Christoph, Micha, et al.
Published: (2025)

The number of random 2-SAT solutions is asymptotically log-normal
by: Chatterjee, Arnab, et al.
Published: (2024)

Short proof of the hypergraph container theorem
by: Nenadov, Rajko, et al.
Published: (2024)

Strong spatial mixing for colorings on trees and its algorithmic applications
by: Chen, Zongchen, et al.
Published: (2023)

Canonical labelling of sparse random graphs
by: Verbitsky, Oleg, et al.
Published: (2024)

Twin-width of sparse random graphs
by: Hendrey, Kevin, et al.
Published: (2023)

First order complexity of finite random structures
by: Demin, Danila, et al.
Published: (2024)

Playing Sudoku on random 3-regular graphs
by: Dippel, Jack, et al.
Published: (2025)