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

zbMATH Open1300.05278MaRDI QIDQ405150FDOQ405150

G. O. Mota, P. Allen, Yoshiharu Kohayakawa, R. F. Parente

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

orientationsdirected graphsrandom graphs

Mathematics Subject Classification ID

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

Cites Work

• Random graphs.
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Extremal Combinatorics
• Szemerédi’s Regularity Lemma for Sparse Graphs
• On the KŁR conjecture in random graphs
• Small subsets inherit sparse \(\varepsilon\)-regularity
• The number of oriantations having no fixed tournament
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

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

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

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