Add to ORKGFor every $k \geq 3$, 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 $k$. This solves a conjecture of Kohayakawa, Morris and the last two authors.Comment: 15 page
AbstractAn acyclic orientation of an undirected graph is an orientation of its edges such that the r...
AbstractSome previously investigated infinite families of cubic graphs have the property that the av...
AbstractAn acyclic orientation of an undirected graph is an orientation of its edges such that the r...
Publication status: PublishedAbstractFor every , we determine the order of growth, up to polylogarit...
Publication status: PublishedAbstractFor every , we determine the order of growth, up to polylogarit...
Publication status: PublishedAbstractFor every , we determine the order of growth, up to polylogarit...
Publication status: PublishedAbstractFor every , we determine the order of growth, up to polylogarit...
We show that, in almost every $n$-vertex random directed graph process, a copy of every possible $n$...
In 2003, Bohman, Frieze, and Martin initiated the study of randomly perturbed graphs and digraphs. F...
The orientable genus of a graph $G$ is the minimum number of handles required to embed that graph on...
AbstractLet G(n,m) be an undirected random graph with n vertices and m multiedges that may include l...
We develop tail estimates for the number of edges in a Chung-Lu random graph with regularly varying ...
We show that the minimum number of orientations of the edges of the n-vertex complete graph having t...
AbstractLet G(n,m) be an undirected random graph with n vertices and m multiedges that may include l...
Let $h>w>0$ be two fixed integers. Let $\orH$ be a random hypergraph whose hyperedges are all of car...
AbstractAn acyclic orientation of an undirected graph is an orientation of its edges such that the r...
AbstractSome previously investigated infinite families of cubic graphs have the property that the av...
AbstractAn acyclic orientation of an undirected graph is an orientation of its edges such that the r...
Publication status: PublishedAbstractFor every , we determine the order of growth, up to polylogarit...
Publication status: PublishedAbstractFor every , we determine the order of growth, up to polylogarit...
Publication status: PublishedAbstractFor every , we determine the order of growth, up to polylogarit...
Publication status: PublishedAbstractFor every , we determine the order of growth, up to polylogarit...
We show that, in almost every $n$-vertex random directed graph process, a copy of every possible $n$...
In 2003, Bohman, Frieze, and Martin initiated the study of randomly perturbed graphs and digraphs. F...
The orientable genus of a graph $G$ is the minimum number of handles required to embed that graph on...
AbstractLet G(n,m) be an undirected random graph with n vertices and m multiedges that may include l...
We develop tail estimates for the number of edges in a Chung-Lu random graph with regularly varying ...
We show that the minimum number of orientations of the edges of the n-vertex complete graph having t...
AbstractLet G(n,m) be an undirected random graph with n vertices and m multiedges that may include l...
Let $h>w>0$ be two fixed integers. Let $\orH$ be a random hypergraph whose hyperedges are all of car...
AbstractAn acyclic orientation of an undirected graph is an orientation of its edges such that the r...
AbstractSome previously investigated infinite families of cubic graphs have the property that the av...
AbstractAn acyclic orientation of an undirected graph is an orientation of its edges such that the r...