A note on counting orientations

DOI10.1016/J.ENDM.2011.05.002MaRDI QIDQ2840675zbMATH OpenOpenAlexFDO

Authors Yoshiharu Kohayakawa, R. F. Parente, G. O. Mota

Publication date 23 July 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

forbidden orientationsrandom graphssparse regularity lemma

Mathematics Subject Classification ID

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

Recommendations

• On the number of orientations of random graphs with no directed cycles of a given length
• Counting H-free orientations of graphs
• Counting restricted orientations of random graphs
• The number of oriantations having no fixed tournament
• Subgraphs of weakly quasi-random oriented graphs

Cites work

• A remark on the number of edge colorings of graphs
• Excluding Induced Subgraphs III: A General Asymptotic
• scientific article; zbMATH DE number 3487496 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 1080356 (Why is no real title available?)
• scientific article; zbMATH DE number 970795 (Why is no real title available?)
• On \(K^ 4\)-free subgraphs of random graphs
• Random graphs.
• Range of values of the entropy of hereditary classes of graphs
• Small subsets inherit sparse \(\varepsilon\)-regularity
• Szemerédi’s Regularity Lemma for Sparse Graphs
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• The number of oriantations having no fixed tournament
• The sparse regularity lemma and its applications
• The Turn Theorem for Random Graphs

Cited in

(8)

• Counting planar Eulerian orientations
• Enumerating \(k\)-arc-connected orientations
• Subgraphs of weakly quasi-random oriented graphs
• Shattering, graph orientations, and connectivity
• On the number of orientations of random graphs with no directed cycles of a given length
• Counting H-free orientations of graphs
• Counting orientations of random graphs with no directed k‐cycles
• A note on parity constrained orientations

This page was built for publication: A note on counting orientations

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