The edge-statistics conjecture for hypergraphs
From MaRDI portal
Cites work
- A completion of the proof of the Edge-statistics Conjecture
- Anti-concentration for polynomials of independent random variables
- Anticoncentration for subgraph statistics
- Bilinear and quadratic variants on the Littlewood-Offord problem
- Binomial approximation to the Poisson binomial distribution
- Combinatorial anti-concentration inequalities, with applications
- Edge-statistics on large graphs
- scientific article; zbMATH DE number 3099315 (Why is no real title available?)
- Intersections of hypergraphs
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
- On a lemma of Littlewood and Offord
- On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices
- Random symmetric matrices are almost surely nonsingular.
- Real advantage
- Symmetrization and concentration inequalities for multilinear forms with applications to zero-one laws for Lévy chaos
- The correct exponent for the Gotsman-Linial conjecture
- The edge-statistics conjecture for \(\ell \ll k^{6/5} \)
- The feasible region of induced graphs
- The inducibility of graphs
- The inducibility of graphs on four vertices
This page was built for publication: The edge-statistics conjecture for hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6924946)