:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Montgomery, Richard, Nenadov, Rajko, Portier, Julien, Szabó, Tibor
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2401.10803
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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)

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

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

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

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

Cliques in minimally globally rigid graphs
by: Portier, Julien
Published: (2026)

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

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

Minors in small-set expanders
by: Krivelevich, Michael, et al.
Published: (2025)

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)

Reconstructing a giant component of a point set in $\mathbb{R}$
by: Portier, Julien
Published: (2026)

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

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

Packing and finding paths in sparse random graphs
by: Iršič, Vesna, et al.
Published: (2024)

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

Globally rigid graphs are fully reconstructible
by: Garamvölgyi, Dániel, et al.
Published: (2021)

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

Reconstructing almost all of a point set in $\mathbb{R}^d$ from randomly revealed pairwise distances
by: Barnes, Douglas, et al.
Published: (2024)

Minimally globally rigid graphs
by: Garamvölgyi, Dániel, et al.
Published: (2022)

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

Almost colour-balanced spanning forests in complete graphs
by: Hollom, Lawrence, et al.
Published: (2024)

On almost Gallai colourings in complete graphs
by: Grebennikov, Alexandr, et al.
Published: (2025)

Slow graph bootstrap percolation I: Cycles
by: Fabian, David, et al.
Published: (2023)

Slow graph bootstrap percolation II: Accelerating properties
by: Fabian, David, et al.
Published: (2023)

Slow graph bootstrap percolation III: Chain constructions
by: Fabian, David, et al.
Published: (2025)

Globally linked pairs and cheapest globally rigid supergraphs
by: Jordán, Tibor, et al.
Published: (2024)

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

Partial reflections and globally linked pairs in rigid graphs
by: Garamvölgyi, Dániel, et al.
Published: (2023)

Discrepancies of spanning trees in dense graphs
by: Hollom, Lawrence, et al.
Published: (2024)

The asymptotic of off-diagonal online Ramsey numbers for paths
by: Mond, Adva, et al.
Published: (2023)

Nearly tight bounds for MaxCut in hypergraphs
by: Janzer, Oliver, et al.
Published: (2025)

Almost-perfect colorful matchings in three-edge-colored bipartite graphs
by: Boyadzhiyska, Simona, et al.
Published: (2025)

Improved bounds for the minimum degree of minimal multicolor Ramsey graphs
by: Attwa, Yamaan, et al.
Published: (2025)

Sufficient conditions for bipartite rigidity, symmetric completability and hyperconnectivity of graphs
by: Garamvölgyi, Dániel, et al.
Published: (2025)

On the number of minimum dominating sets and total dominating sets in forests
by: Petr, Jan, et al.
Published: (2022)

Tight bounds for expected propagation time of probabilistic zero forcing
by: Jelassi, Mehdi, et al.
Published: (2025)

Double-jump phase transition for the reverse Littlewood--Offord problem
by: Hollom, Lawrence, et al.
Published: (2025)