Article ID Journal Published Year Pages File Type
5777080 Electronic Notes in Discrete Mathematics 2017 7 Pages PDF
Abstract
We study the number of orientations Tr(n,p) of the binomial random graph G(n,p) in which every copy of Kr is transitive. We give the correct order of growth of log2⁡Tr(n,p) up to polylogarithmic factors. In particular, this significantly improves a result of Allen, Kohayakawa, Mota and Parente on T3(n,p).
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On the number of r-transitive orientations of G(n,p)
Authors
, , , ,