A sharp threshold for a non-monotone digraph property

MaRDI QIDQ4428909zbMATH OpenFDO

Authors Jean-Marie Le Bars

Publication date 22 September 2003

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Recommendations

• Sharp thresholds of graph properties, and the k-sat problem
• scientific article; zbMATH DE number 2188468
• Walks on random digraphs
• Every monotone graph property has a sharp threshold
• Induced acyclic tournaments in random digraphs: sharp concentration, thresholds and algorithms

Cited in

(2)

• Every monotone graph property has a sharp threshold
• scientific article; zbMATH DE number 2188468 (Why is no real title available?)

This page was built for publication: A sharp threshold for a non-monotone digraph property

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