On the upper tail of counts of strictly balanced subgraphs
From MaRDI portal
(Redirected from Publication:426748)
Recommendations
- scientific article; zbMATH DE number 3865331
- scientific article; zbMATH DE number 701118
- Upper tails for subgraph counts in random graphs
- Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs
- scientific article; zbMATH DE number 4041966
- Upper bounds for the \(k\)-subdomination number of graphs
- Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph
- scientific article; zbMATH DE number 568785
- Upper tail for homomorphism counts in constrained sparse random graphs
Cited in
(12)- Upper tails via high moments and entropic stability
- scientific article; zbMATH DE number 3865331 (Why is no real title available?)
- scientific article; zbMATH DE number 701118 (Why is no real title available?)
- The lower tail: Poisson approximation revisited
- The missing log in large deviations for triangle counts
- Tight upper tail bounds for cliques
- On the missing log in upper tail estimates
- Sub-Gaussian tails for the number of triangles in \(G( n, p)\)
- A counterexample to the DeMarco-Kahn upper tail conjecture
- Upper tails for arithmetic progressions in random subsets
- Upper tail bounds for stars
- Upper tail bounds for cycles
This page was built for publication: On the upper tail of counts of strictly balanced subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q426748)
