Cover Image

The Mihail-Vazirani conjecture and strong edge-expansion in random $0/1$ polytopes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Christoph, Micha, Diskin, Sahar, Lichev, Lyuben, Sudakov, Benny
Format:	Preprint
Published:	2026
Subjects:	Combinatorics Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

$d$-connectivity of the random graph with restricted budget
by: Lichev, Lyuben
Published: (2022)

Saturation in Random Hypergraphs
by: Diskin, Sahar, et al.
Published: (2024)

Diameter and mixing time of the giant component in the percolated hypercube
by: Anastos, Michael, et al.
Published: (2025)

Sharp thresholds, hitting times and the power of choice for random geometric graphs
by: Ignasiak, Dawid, et al.
Published: (2025)

Hitting time of connectedness in the random hypercube process
by: Diskin, Sahar, et al.
Published: (2024)

Dynamic random graphs with vertex removal
by: Díaz, Josep, et al.
Published: (2022)

Tree tilings in random regular graphs
by: Diskin, Sahar, et al.
Published: (2024)

Monotonicity and decompositions of random regular graphs
by: Hollom, Lawrence, et al.
Published: (2025)

Components, large and small, are as they should be II: supercritical percolation on regular graphs of constant degree
by: Diskin, Sahar, et al.
Published: (2024)

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

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

Colouring random Hasse diagrams and box-Delaunay graphs
by: Jin, Zhihan, et al.
Published: (2025)

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

Supercritical Site Percolation on Regular Graphs
by: Diskin, Sahar, et al.
Published: (2026)

A Jump of the Saturation Number in Random Graphs?
by: Diskin, Sahar, et al.
Published: (2023)

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

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

Vertex-separating path systems in random graphs
by: Lichev, Lyuben, et al.
Published: (2024)

Approximate Itai-Zehavi conjecture for random graphs
by: Hollom, Lawrence, et al.
Published: (2025)

Perfect Matching in Product Graphs and in their Random Subgraphs
by: Diskin, Sahar, et al.
Published: (2024)

Minimum degree $k$ and $k$-connectedness usually arrive together
by: Diskin, Sahar, et al.
Published: (2024)

Restricted subgraphs of edge-colored graphs and applications
by: Sudakov, Benny
Published: (2024)

Supercritical sharpness of percolation
by: Diskin, Sahar, et al.
Published: (2026)

Brownian snails with removal die out in one dimension
by: Hartarsky, Ivailo, et al.
Published: (2023)

On the local resilience of random geometric graphs with respect to connectivity and long cycles
by: Díaz, Alberto Espuny, et al.
Published: (2024)

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

On the edge expansion of random polytopes
by: Ferber, Asaf, et al.
Published: (2025)

Percolation on dense random graphs with given degrees
by: Lichev, Lyuben, et al.
Published: (2022)

Random walks on edge colored random graphs
by: Cooper, Colin, et al.
Published: (2024)

Evolution of discordant edges in the voter model on random sparse digraphs
by: Capannoli, Federico
Published: (2024)

A local limit theorem for the edge counts of random induced subgraphs of a random graph
by: Balister, Paul, et al.
Published: (2025)

Topological expansion for posets and the homological $k$-connectivity of random $q$-complexes
by: Tessler, Ran, et al.
Published: (2023)

The large $N$ factorization does not hold for arbitrary multi-trace observables in random tensors
by: Gurau, Razvan, et al.
Published: (2025)

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)