Counting restricted orientations of random graphs

DOI10.1002/rsa.20904zbMath1451.05210arXiv1811.03080OpenAlexW3000224941WikidataQ122111935 ScholiaQ122111935MaRDI QIDQ5128751

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

Publication date: 26 October 2020

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.03080

zbMATH Keywords

random graphsforbidden digraphsrestricted orientations

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Related Items

Counting H-free orientations of graphs ⋮ Counting orientations of random graphs with no directed k‐cycles

Cites Work

• On the number of orientations of random graphs with no directed cycles of a given length
• Threshold functions for extension statements
• Searching for acyclic orientations of graphs
• The number of oriantations having no fixed tournament
• Graph bootstrap percolation
• Optimal Randomized Algorithms for Local Sorting and Set-Maxima
• Threshold Functions for Ramsey Properties
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item