Counting orientations of random graphs with no directed k‐cycles

IF 0.9 3区数学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Random Structures & Algorithms Pub Date : 2023-11-07 DOI:10.1002/rsa.21196

Marcelo Campos, Maurício Collares, Guilherme Oliveira Mota

引用次数: 0

Abstract

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.

查看原文本刊更多论文

无有向k环随机图的计数方向

摘要对于每一个不含长度有向环的二项随机图，我们确定了其方向数的增长顺序，直至多对数因子。这解决了Kohayakawa, Morris和最后两位作者的猜想。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Random Structures & Algorithms 数学-计算机：软件工程

CiteScore

2.50

自引率

10.00%

发文量

审稿时长

>12 weeks

期刊介绍： It is the aim of this journal to meet two main objectives: to cover the latest research on discrete random structures, and to present applications of such research to problems in combinatorics and computer science. The goal is to provide a natural home for a significant body of current research, and a useful forum for ideas on future studies in randomness. Results concerning random graphs, hypergraphs, matroids, trees, mappings, permutations, matrices, sets and orders, as well as stochastic graph processes and networks are presented with particular emphasis on the use of probabilistic methods in combinatorics as developed by Paul Erdõs. The journal focuses on probabilistic algorithms, average case analysis of deterministic algorithms, and applications of probabilistic methods to cryptography, data structures, searching and sorting. The journal also devotes space to such areas of probability theory as percolation, random walks and combinatorial aspects of probability.