:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Anastos, Michael, Cooley, Oliver, Kang, Mihyun, Kwan, Matthew
Format:	Preprint
Published:	2023
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2307.06453
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The law of the circumference of sparse binomial random graphs
by: Anastos, Michael, et al.
Published: (2025)

Warning Propagation on random graphs
by: Coja-Oghlan, Amin, et al.
Published: (2021)

Optimally building spanning graphs in semirandom graph processes
by: Anastos, Michael, et al.
Published: (2025)

A short proof of a central limit theorem for the order of the giant component and $k$-core
by: Anastos, Michael, et al.
Published: (2025)

Counting subgraphs in bounded-size Achlioptas processes
by: Kang, Mihyun, et al.
Published: (2026)

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)

Smoothed analysis for graph isomorphism
by: Anastos, Michael, et al.
Published: (2024)

The completion numbers of Hamiltonicity and pancyclicity in random graphs
by: Alon, Yahav, et al.
Published: (2023)

A note on the width of sparse random graphs
by: Do, Tuan Anh, et al.
Published: (2022)

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

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

Fragile minor-monotone parameters under random edge perturbation
by: Kang, Dong Yeap, et al.
Published: (2020)

Extremal, enumerative and probabilistic results on ordered hypergraph matchings
by: Anastos, Michael, et al.
Published: (2023)

Robust Hamiltonicity in families of Dirac graphs
by: Anastos, Michael, et al.
Published: (2023)

A note on finding large transversals efficiently
by: Anastos, Michael, et al.
Published: (2024)

Counting independent sets in percolated graphs via the Ising model
by: Geisler, Anna, et al.
Published: (2025)

Block-weighted random graphs: planar and beyond
by: Kang, Mihyun, et al.
Published: (2026)

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

Bootstrap percolation on the high-dimensional Hamming graph
by: Kang, Mihyun, et al.
Published: (2024)

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

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

The sharp threshold for jigsaw percolation in random graphs
by: Cooley, Oliver, et al.
Published: (2018)

Geometric Littlewood-Offord problems via lattice point counting
by: Grebennikov, Alexandr, et al.
Published: (2025)

Catching a robber on a random $k$-uniform hypergraph
by: Erde, Joshua, et al.
Published: (2023)

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

Sampling from the antiferromagnetic Ising model on bipartite, regular expander graphs
by: Geisler, Anna, et al.
Published: (2026)

On the chromatic number of powers of subdivisions of graphs
by: Anastos, Michael, et al.
Published: (2024)

No-$(k+1)$-in-line problem for large constant $k$
by: Grebennikov, Alexandr, et al.
Published: (2025)

On the number of spanning trees in random regular graphs
by: Greenhill, Catherine, et al.
Published: (2013)

Universal behaviour of majority bootstrap percolation on high-dimensional geometric graphs
by: Collares, Maurício, et al.
Published: (2024)

Uniqueness and locality of the ground state of the disordered Monomer-Dimer models on independently weighted Unimodular Bienaymé-Galton-Watson trees
by: Kang, Mihyun, et al.
Published: (2026)

Loose Hamilton paths in the 3-uniform cube hypergraph
by: Cooley, Oliver, et al.
Published: (2024)

Permanents of random matrices over finite fields
by: Hunter, Zach, et al.
Published: (2026)

Singularity of the k-core of a random graph
by: Ferber, Asaf, et al.
Published: (2021)

Warning Propagation: stability and subcriticality
by: Cooley, Oliver, et al.
Published: (2021)

A central limit theorem for the matching number of a sparse random graph
by: Glasgow, Margalit, et al.
Published: (2024)

Isoperimetric Inequalities and Supercritical Percolation on High-dimensional Graphs
by: Diskin, Sahar, et al.
Published: (2023)

Percolation through Isoperimetry
by: Diskin, Sahar, et al.
Published: (2023)

Percolation on High-dimensional Product Graphs
by: Diskin, Sahar, et al.
Published: (2022)