International audienceWe prove the existence of a function $h(k)$ such that every simple digraph with minimum outdegree greater than $h(k)$ contains an immersion of the transitive tournament on k vertices. This solves a conjecture of Devos, McDonald, Mohar and Scheide
AbstractFor an oriented graph G with n vertices, let f(G) denote the minimum number of transitive su...
An edge coloring of a tournament T with colors 1,2,…,k is called \it k-transitive \rm if the digraph...
AbstractIn this paper we investigate the following generalization of transitivity: A digraph D is (m...
International audienceWe prove the existence of a function $h(k)$ such that every simple digraph wit...
The main purpose of the thesis was to exhibit sufficient conditions on digraphs to find subdivisions...
In 1985, Mader conjectured the existence of a function f such that every digraph with minimum out-de...
International audienceIn 1985, Mader conjectured the existence of a function f such that every digra...
In 1985, Mader conjectured the existence of a function f such that every digraph with minimum out-de...
AbstractWe consider the problem of immersing the complete digraph on t vertices in a simple digraph....
Le but principal de cette thèse est de présenter des conditions suffisantes pour garantir l'existenc...
AbstractWe determine, to within a constant factor, the maximum size of a digraph that does not conta...
AbstractFor a digraphG=(V,E) letw(Gn) denote the maximum possible cardinality of a subsetSofVnin whi...
AbstractErdös and Moser [1] displayed a tournament of order 7 with no transitive subtournament of or...
AbstractA (loopless) digraph H is strongly immersed in a digraph G if the vertices of H are mapped t...
AbstractA k-king in a digraph D is a vertex which can reach every other vertex by a directed path of...
AbstractFor an oriented graph G with n vertices, let f(G) denote the minimum number of transitive su...
An edge coloring of a tournament T with colors 1,2,…,k is called \it k-transitive \rm if the digraph...
AbstractIn this paper we investigate the following generalization of transitivity: A digraph D is (m...
International audienceWe prove the existence of a function $h(k)$ such that every simple digraph wit...
The main purpose of the thesis was to exhibit sufficient conditions on digraphs to find subdivisions...
In 1985, Mader conjectured the existence of a function f such that every digraph with minimum out-de...
International audienceIn 1985, Mader conjectured the existence of a function f such that every digra...
In 1985, Mader conjectured the existence of a function f such that every digraph with minimum out-de...
AbstractWe consider the problem of immersing the complete digraph on t vertices in a simple digraph....
Le but principal de cette thèse est de présenter des conditions suffisantes pour garantir l'existenc...
AbstractWe determine, to within a constant factor, the maximum size of a digraph that does not conta...
AbstractFor a digraphG=(V,E) letw(Gn) denote the maximum possible cardinality of a subsetSofVnin whi...
AbstractErdös and Moser [1] displayed a tournament of order 7 with no transitive subtournament of or...
AbstractA (loopless) digraph H is strongly immersed in a digraph G if the vertices of H are mapped t...
AbstractA k-king in a digraph D is a vertex which can reach every other vertex by a directed path of...
AbstractFor an oriented graph G with n vertices, let f(G) denote the minimum number of transitive su...
An edge coloring of a tournament T with colors 1,2,…,k is called \it k-transitive \rm if the digraph...
AbstractIn this paper we investigate the following generalization of transitivity: A digraph D is (m...
DOI
Add to ORKG