On the number of orientations of random graphs with no directed cycles of a given length

zbMath1300.05278MaRDI QIDQ405150

J. Herrera, H. S. Yoon

Publication date: 4 September 2014

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

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p52

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

random graphsdirected graphsorientations

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Counting H-free orientations of graphs ⋮ On the number of \(r\)-transitive orientations of \(G(n,p)\) ⋮ Counting orientations of random graphs with no directed k‐cycles ⋮ Counting restricted orientations of random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the KŁR conjecture in random graphs
• Small subsets inherit sparse \(\varepsilon\)-regularity
• The number of oriantations having no fixed tournament
• Extremal Combinatorics
• Szemerédi’s Regularity Lemma for Sparse Graphs

This page was built for publication: On the number of orientations of random graphs with no directed cycles of a given length