Cover Image

Minors in small-set expanders

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Krivelevich, Michael, Nenadov, Rajko
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improved bound on the number of cycle sets
by: Nenadov, Rajko
Published: (2025)

Sumsets of random sets
by: Nenadov, Rajko, et al.
Published: (2026)

A remark on the independence number of sparse random Cayley sum graphs
by: Nenadov, Rajko
Published: (2025)

The number of arcs in $\mathbb{F}_q^2$ of a given cardinality
by: Nenadov, Rajko
Published: (2024)

Counting sparse induced subgraphs in locally dense graphs
by: Nenadov, Rajko
Published: (2024)

Multipartite nearly orthogonal sets over finite fields
by: Nenadov, Rajko, et al.
Published: (2024)

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

Refuting Perfect Matchings in Spectral Expanders is Hard
by: Biswas, Ari, et al.
Published: (2025)

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

Smaller universal posets
by: Bastide, Paul, et al.
Published: (2025)

The Hamilton space of pseudorandom graphs
by: Christoph, Micha, et al.
Published: (2024)

Spread blow-up lemma with an application to perturbed random graphs
by: Nenadov, Rajko, et al.
Published: (2024)

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

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

Disjoint connected dominating sets in pseudorandom graphs
by: Draganić, Nemanja, et al.
Published: (2024)

Long cycles in percolated expanders
by: Collares, Maurício, 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)

Universality for graphs with bounded density
by: Alon, Noga, et al.
Published: (2023)

The Hamilton cycle space of random graphs
by: Hefetz, Dan, et al.
Published: (2025)

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

The Hamilton cycle space of random regular graphs and randomly perturbed graphs
by: Hefetz, Dan, et al.
Published: (2025)

Colouring graphs from random lists
by: Hefetz, Dan, et al.
Published: (2024)

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

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

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

Efficient algorithms for the Potts model on small-set expanders
by: Carlson, Charles, et al.
Published: (2020)

Bounded-degree spanning trees in randomly perturbed graphs
by: Krivelevich, Michael, et al.
Published: (2015)

Combinatorial sufficient conditions for graph rigidity and applications to random graphs
by: Krivelevich, Michael, et al.
Published: (2026)

Subgraph discrepancies in the complete graph
by: Christoph, Micha, et al.
Published: (2026)

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

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

The power of many colours
by: Alon, Noga, et al.
Published: (2023)

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

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

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

On Independent Spanning Trees in Random and Pseudorandom Graphs
by: Draganić, Nemanja, et al.
Published: (2025)

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

Minimum degree conditions for graph rigidity
by: Krivelevich, Michael, et al.
Published: (2024)

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