Friendly bisections of random graphs
From MaRDI portal
Publication:6052387
DOI10.1090/cams/13zbMath1522.05424arXiv2105.13337MaRDI QIDQ6052387
Bhargav P. Narayanan, Ashwin Sah, Asaf Ferber, Mehtaab Sawhney, Matthew Kwan
Publication date: 17 October 2023
Published in: Communications of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.13337
Related Items
Combinatorics. Abstracts from the workshop held January 1--7, 2023, A note on internal partitions: the 5-regular case and beyond
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unfriendly partitions of a graph
- The early evolution of the \(H\)-free process
- On a packing and covering problem
- Algorithmic approach to the satisfactory graph partitioning problem
- Zero-temperature dynamics in the dilute Curie-Weiss model
- Asymptotic enumeration by degree sequence of graphs of high degree
- Local minima in disordered mean-field ferromagnets
- Asymptotically almost every \(2r\)-regular graph has an internal partition
- Random triangle removal
- Asymptotic enumeration of dense 0-1 matrices with specified line sums
- Internal Partitions of Regular Graphs
- A Complete Proof of Universal Inequalities for the Distribution Function of the Binomial Law
- Graph decomposition with constraints on the connectivity and minimum degree
- An estimate of the remainder in a combinatorial central limit theorem
- On the max‐cut of sparse random graphs
- High-Dimensional Probability
- Problems and results on judicious partitions
- The number of graphs and a random graph with a given degree sequence
- Anticoncentration for subgraph statistics
- Local max-cut in smoothed polynomial time
- The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
- ASYMPTOTIC ENUMERATION OF GRAPHS WITH GIVEN DEGREE SEQUENCE
- Smoothed complexity of local max-cut and binary max-CSP
- Anticoncentration versus the Number of Subset Sums
- Local optima of the Sherrington-Kirkpatrick Hamiltonian
- Asymptotic Enumeration of Hypergraphs by Degree Sequence
- Singularity of sparse random matrices: simple proofs
