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 log2Tr(n,p) up to polylogarithmic factors. In particular, this significantly improves a result of Allen, Kohayakawa, Mota and Parente on T3(n,p).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
