A note on counting orientations

DOI10.1016/j.endm.2011.05.002zbMath1268.05182OpenAlexW2048150919MaRDI QIDQ2840675

Roberto F. Parente, Yoshiharu Kohayakawa, Guilherme Oliveira 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

random graphssparse regularity lemmaforbidden orientations

Mathematics Subject Classification ID

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

Related Items

Shattering, graph orientations, and connectivity

Cites Work

• Small subsets inherit sparse \(\varepsilon\)-regularity
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• On \(K^ 4\)-free subgraphs of random graphs
• A remark on the number of edge colorings of graphs
• The number of oriantations having no fixed tournament
• Excluding Induced Subgraphs III: A General Asymptotic
• Szemerédi’s Regularity Lemma for Sparse Graphs
• The Turn Theorem for Random Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item