Counting orientations of random graphs with no directed k-cycles
Combinatorics
2023-11-09 v2
Abstract
For every , we determine the order of growth, up to polylogarithmic factors, of the number of orientations of the binomial random graph containing no directed cycle of length . This solves a conjecture of Kohayakawa, Morris and the last two authors.
Keywords
Cite
@article{arxiv.2209.03339,
title = {Counting orientations of random graphs with no directed k-cycles},
author = {Marcelo Campos and Maurício Collares and Guilherme Oliveira Mota},
journal= {arXiv preprint arXiv:2209.03339},
year = {2023}
}
Comments
17 pages, minor changes