On the upper tail of counts of strictly balanced subgraphs

zbMATH Open1243.05222MaRDI QIDQ426748FDOQ426748

Authors: M. Şileikis 

Publication date: 12 June 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i1p4

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

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

zbMATH Keywords

deletion methodmatching bounds for strictly balanced graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Cited In (12)

• Upper tails via high moments and entropic stability
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)