Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture
From MaRDI portal
Publication:6049024
DOI10.1017/fmp.2023.17arXiv2208.02874WikidataQ123323699 ScholiaQ123323699MaRDI QIDQ6049024
Lisa Sauermann, Matthew Kwan, Ashwin Sah, Mehtaab Sawhney
Publication date: 15 September 2023
Published in: Forum of Mathematics, Pi (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.02874
Related Items (1)
Cites Work
- Constructing Ramsey graphs from Boolean function representations
- Inverse Littlewood-Offord problems and the singularity of random symmetric matrices
- Random walks in Euclidean space
- Optimal inverse Littlewood-Offord theorems
- Ramsey graphs contain many distinct induced subgraphs
- Random symmetric matrices are almost surely nonsingular.
- Induced subgraphs of Ramsey graphs with many distinct degrees
- Noise stability of functions with low influences: invariance and optimality
- Intersection theorems with geometric consequences
- Erdős and Rényi conjecture
- Atavistic dynamics in a two-sector economy
- Some recent problems and results in graph theory
- The complexity of proving that a graph is Ramsey
- Non-Ramsey graphs are \(c\log n\)-universal
- Graphs with a small number of distinct induced subgraphs
- On rank vs. communication complexity
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
- Bilinear and quadratic variants on the Littlewood-Offord problem
- A structure theorem for poorly anticoncentrated polynomials of Gaussians and applications to the study of polynomial threshold functions
- On the directions determined by a Cartesian product in an affine Galois plane
- Asymptotic distribution of Bernoulli quadratic forms
- The edge-statistics conjecture for \(\ell \ll k^{6/5} \)
- Harmonicity and invariance on slices of the Boolean cube
- The average number of spanning trees in sparse graphs with given degrees
- Normal approximation to the hypergeometric distribution in nonstandard cases and a sub-Gaussian Berry-Esseen theorem
- Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
- Probabilistic existence of regular combinatorial structures
- Ramsey graphs induce subgraphs of many different sizes
- The Littlewood-Offord problem and invertibility of random matrices
- On a Ramsey type theorem
- Graph removal lemmas
- An Introduction to Randomness Extractors
- A sharp inverse Littlewood-Offord theorem
- Dependent random choice
- Distinct degrees in induced subgraphs
- Sizes of Induced Subgraphs of Ramsey Graphs
- Induced subgraphs with distinct sizes
- A note on constructive methods for ramsey numbers
- Estimates for the concentration function of combinatorial number theory and probability
- On Subgraph Sizes in Random Graphs
- [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
- Induced subgraphs of prescribed size
- Probability
- Algorithms with large domination ratio
- Repeated communication and Ramsey graphs
- Combinatorial anti-concentration inequalities, with applications
- Anticoncentration for subgraph statistics
- Invariance Principle on the Slice
- Refined estimates concerning sumsets contained in the roots of unity
- Edge-statistics on large graphs
- Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes
- A completion of the proof of the Edge-statistics Conjecture
- An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs
- Analysis of Boolean Functions
- Recent developments in non-asymptotic theory of random matrices
- Proof of a conjecture on induced subgraphs of Ramsey graphs
- Two-source dispersers for polylogarithmic entropy and improved ramsey graphs
- Explicit two-source extractors and resilient functions
- Invertibility of symmetric random matrices
- Small Ball Probability, Inverse Theorems, and Applications
- A Bound on Tail Probabilities for Quadratic Forms in Independent Random Variables
- A local central limit theorem for triangles in a random graph
- Some remarks on the theory of graphs
- On a lemma of Littlewood and Offord
- On the number of Hadamard matrices via anti-concentration
- Lower bounds for some Ramsey numbers
- Concentration of multivariate polynomials and its applications
- Distributional and \(L^q\) norm inequalities for polynomials over convex bodies in \(\mathbb{R}^n\)
- Local limit theorems for subgraph counts
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture
