On the upper tail of counts of strictly balanced subgraphs

zbMath1243.05222MaRDI QIDQ426748

Matas Š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

zbMATH Keywords

deletion methodmatching bounds for strictly balanced graphs

Mathematics Subject Classification ID

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

Related Items (7)

Upper tails via high moments and entropic stability ⋮ Upper tails for arithmetic progressions in random subsets ⋮ Upper Tail Bounds for Cycles ⋮ The lower tail: Poisson approximation revisited ⋮ On the missing log in upper tail estimates ⋮ A counterexample to the DeMarco‐Kahn upper tail conjecture ⋮ Upper tail bounds for stars

This page was built for publication: On the upper tail of counts of strictly balanced subgraphs