Bisecting sparse random graphs

DOI<31::AID-RSA3>3.0.CO;2-1 10.1002/1098-2418(200101)18:1<31::AID-RSA3>3.0.CO;2-1zbMath0968.05071OpenAlexW2080818361MaRDI QIDQ4761356

Malwina J. Luczak, Colin J. H. McDiarmid

Publication date: 11 February 2001

Full work available at URL: https://doi.org/10.1002/1098-2418(200101)18:1<31::aid-rsa3>3.0.co;2-1

zbMATH Keywords

partitionsprobabilitybisection widthsparse random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (10)

The symmetry in the martingale inequality ⋮ Crossing numbers of random graphs ⋮ Unnamed Item ⋮ On the minimum bisection of random 3-regular graphs ⋮ Modularity of Erdős‐Rényi random graphs ⋮ Bipartitioning of directed and mixed random graphs ⋮ Clique percolation ⋮ Sparse graphs: Metrics and random models ⋮ The cut metric, random graphs, and branching processes ⋮ The peculiar phase structure of random graph bisection

Cites Work

• Probabilistic methods for algorithmic discrete mathematics

This page was built for publication: Bisecting sparse random graphs