On the number of \(r\)-transitive orientations of \(G(n,p)\)

DOI10.1016/J.ENDM.2017.06.046zbMATH Open1378.05181OpenAlexW2743928356WikidataQ101496306 ScholiaQ101496306MaRDI QIDQ1689921

Yoshiharu Kohayakawa, Robert Morris, Guilherme Oliveira Mota, Maurício Collares

Publication date: 18 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.06.046

zbMATH Keywords

random graphsorientations

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• On the number of orientations of random graphs with no directed cycles of a given length
• Threshold functions for extension statements
• The number of oriantations having no fixed tournament
• Cliques in random graphs

Related Items (1)

On transitive orientations of G-e

This page was built for publication: On the number of \(r\)-transitive orientations of \(G(n,p)\)