On the Number of Orientations of Random Graphs with No Directed Cycles of a Given Length

Electronic Journal Of Combinatorics

P. Allen¹ 

关键词: directed graphs;    random graphs;    orientations;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Let $\vec H$ be an orientation of a graph $H$. Alon and Yuster proposed the problem of determining or estimating $D(n,m,\vec H)$, the maximum number of $\vec H$-free orientations a graph with $n$ vertices and $m$ edges may have. We consider the maximum nu

【 授权许可】

Others