Add to ORKGPublication status: PublishedAbstractFor 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
International audienceAn orientation of a graph G is a digraph D obtained from G by replacing each e...
International audienceAn orientation of a graph G is a digraph D obtained from G by replacing each e...
International audienceAn orientation of a graph G is a digraph D obtained from G by replacing each e...
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...
For every $k \geq 3$, we determine the order of growth, up to polylogarithmic factors, of the number...
AbstractWe answer a question of Cameron’s by giving examples of 2ℵ0 many non-isomorphic acyclic orie...
AbstractAn acyclic orientation of an undirected graph is an orientation of its edges such that the r...
Abstract. We answer a question of P. Cameron’s by giving ex-amples of 2ℵ0 many non-isomorphic acycli...
Abstract. We answer a question of P. Cameron’s by giving ex-amples of 2ℵ0 many non-isomorphic acycli...
A Smarandache k-orientation of G for an integer k ≥ 0 is such an orientation on G with exactly k ori...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2015.Cataloged fro...
We prove that for all # 3and#>0 there exists a sparse oriented graph of arbitrarily large order...
Seja H\' uma orientação do grafo H. Alon e Yuster [The number of orientations having no fixed tounam...
International audienceAn orientation of a graph G is a digraph D obtained from G by replacing each e...
International audienceAn orientation of a graph G is a digraph D obtained from G by replacing each e...
International audienceAn orientation of a graph G is a digraph D obtained from G by replacing each e...
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...
For every $k \geq 3$, we determine the order of growth, up to polylogarithmic factors, of the number...
AbstractWe answer a question of Cameron’s by giving examples of 2ℵ0 many non-isomorphic acyclic orie...
AbstractAn acyclic orientation of an undirected graph is an orientation of its edges such that the r...
Abstract. We answer a question of P. Cameron’s by giving ex-amples of 2ℵ0 many non-isomorphic acycli...
Abstract. We answer a question of P. Cameron’s by giving ex-amples of 2ℵ0 many non-isomorphic acycli...
A Smarandache k-orientation of G for an integer k ≥ 0 is such an orientation on G with exactly k ori...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2015.Cataloged fro...
We prove that for all # 3and#>0 there exists a sparse oriented graph of arbitrarily large order...
Seja H\' uma orientação do grafo H. Alon e Yuster [The number of orientations having no fixed tounam...
International audienceAn orientation of a graph G is a digraph D obtained from G by replacing each e...
International audienceAn orientation of a graph G is a digraph D obtained from G by replacing each e...
International audienceAn orientation of a graph G is a digraph D obtained from G by replacing each e...