Combinatorial estimates by the switching method

MaRDI QIDQ3001409zbMATH OpenFDO

Authors Mahdieh Hasheminezhad, Brendan D. McKay

Publication date 31 May 2011

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Combinatorial inequalities (05A20) Combinatorial probability (60C05)

Recommendations

• scientific article; zbMATH DE number 5239164
• The deletion method for upper tail estimates
• The infamous upper tail
• Approximate counting of regular hypergraphs
• Probabilistic Methods in Combinatorial Analysis

Cited in

(8)

• Uniform switching system by families of switching sets
• Exponential bounds on graph enumerations from vertex incremental characterizations
• scientific article; zbMATH DE number 5239164 (Why is no real title available?)
• Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture
• Large deviations in random latin squares
• Counting deranged matchings
• Switching codes and designs
• Sprinkling with random regular graphs

This page was built for publication: Combinatorial estimates by the switching method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3001409)