General deletion lemmas via the Harris inequality

DOI10.4310/JOC.2013.v4.n2.a5zbMath1275.05053OpenAlexW1964710791WikidataQ124832602 ScholiaQ124832602MaRDI QIDQ376551

Angelika Steger, Lutz Warnke, Reto Spöhel

Publication date: 5 November 2013

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

Full work available at URL: http://intlpress.com/site/pub/pages/journals/items/joc/content/vols/0004/0002/a005/index.html

zbMATH Keywords

random graphsdecreasing propertydeletion methodHarris inequalitysubgraph countsupper tails

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (3)

Counting extensions revisited ⋮ Bounds on Ramsey games via alterations ⋮ On the missing log in upper tail estimates

This page was built for publication: General deletion lemmas via the Harris inequality