Cover Image

A large hole in pseudo-random graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Diskin, Sahar, Krivelevich, Michael, Markbreit, Itay, Zhukovskii, Maksim
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

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

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

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)

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

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

Stability of large cuts in random graphs
by: Hoshen, Ilay, et al.
Published: (2024)

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

Non-isomorphic subgraphs in random graphs
by: Krivelevich, Michael, et al.
Published: (2025)

Maximum chordal subgraphs of random graphs
by: Krivelevich, Michael, et al.
Published: (2023)

Reconstructing random graphs from distance queries
by: Krivelevich, Michael, et al.
Published: (2024)

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

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

A very sharp threshold for first order logic distinguishability of random graphs
by: Benjamini, Itai, 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)

A logical approach to concentration
by: Benedikt, Michael, et al.
Published: (2026)

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

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)

When does a tree activate the random graph?
by: Antonir, Asaf Cohen, et al.
Published: (2025)

Extremal independence in discrete random systems
by: Isaev, Mikhail, et al.
Published: (2021)

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)

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

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

The Mihail-Vazirani conjecture and strong edge-expansion in random $0/1$ polytopes
by: Christoph, Micha, et al.
Published: (2026)

Majority dynamics on finite trees
by: Benjamini, Itai, 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)

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

On the threshold for triangulations inside convex polygons
by: Kolesnik, Brett, et al.
Published: (2025)

Colouring random subgraphs
by: Bukh, Boris, et al.
Published: (2023)

On the maximum number of common neighbours in dense random regular graphs
by: Isaev, Mikhail, et al.
Published: (2023)

First order distinguishability of sparse random graphs
by: Hershko, Tal, et al.
Published: (2024)

Weak saturation numbers of large complete bipartite graphs
by: Akhmejanova, Margarita, et al.
Published: (2025)

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

Maximum induced trees and forests of bounded degree in random graphs
by: Akhmejanova, Margarita, et al.
Published: (2024)