Repository logo
 

Counting orientations of random graphs with no directed k‐cycles

Published version
Peer-reviewed

Repository DOI


Change log

Authors

Campos, Marcelo 
Collares, Maurício  ORCID logo  https://orcid.org/0000-0001-5856-611X
Mota, Guilherme Oliveira 

Abstract

jats:titleAbstract</jats:title>jats:pFor 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.</jats:p>

Description

Publication status: Published

Keywords

4901 Applied Mathematics, 4904 Pure Mathematics, 49 Mathematical Sciences

Journal Title

Random Structures &amp; Algorithms

Conference Name

Journal ISSN

1042-9832
1098-2418

Volume Title

Publisher

Wiley
Sponsorship
CNPq (406248/2021‐4, 306620/2020‐0)
Austrian Science Fund (FWF) (P36131)
FAPESP (2018/04876‐1, 2019/13364‐7)