AbstractIn this work is proven the existence of non-Cayley vertex-transitive tournaments of order pk, for each prime p⩾3 and k⩾4, and an explicit construction is given. These tournaments are special cases of (pk-1,p)-metacirculant digraphs, and have the same automorphism group as the first non-Cayley vertex-transitive digraphs of order pk, given by Marušič in 1985. Moreover, from these tournaments, new non-Cayley vertex-transitive tournaments that realise many more degrees are constructed
International audienceWe prove the existence of a function $h(k)$ such that every simple digraph wit...
The study of problems concerning subdivisions of graphs has a rich history in extremal combinatorics...
AbstractThis paper completes the determination of all integers of the form pqr (where p, q, and r ar...
AbstractIn this work is proven the existence of non-Cayley vertex-transitive tournaments of order pk...
AbstractIn this paper, we prove that non-circulant vertex-transitive tournaments of order pq, where ...
Abstract. Few families of tournaments satisfying the n-e.c. adjacency property are known. We supply ...
AbstractMarušič (Ann. Discrete Math. 27 (1985) 115) proved that all vertex-transitive graphs of orde...
The pursuit to identify vertex-transitive non-Cayley graphs has been deliberate for some time ...
For a positive integer n, does there exist a vertex-transitive graph Γ on n vertices which is not a ...
AbstractIn this paper, we exhibit infinite families of vertex critical r-dichromatic circulant tourn...
Abstract(1). We determine the number of non-isomorphic classes of self-complementary circulant digra...
The first part of this dissertation deals with highly symmetrical combinatorial structures - vertex ...
Let TTk denote the transitive tournament on k vertices. Let TT (h, k) denote the graph obtained from...
We survey results concerning various generalizations of tournaments. The reader will see that tourna...
AbstractA king in a tournament is a vertex which can reach every other vertex via a 1-path or 2-path...
International audienceWe prove the existence of a function $h(k)$ such that every simple digraph wit...
The study of problems concerning subdivisions of graphs has a rich history in extremal combinatorics...
AbstractThis paper completes the determination of all integers of the form pqr (where p, q, and r ar...
AbstractIn this work is proven the existence of non-Cayley vertex-transitive tournaments of order pk...
AbstractIn this paper, we prove that non-circulant vertex-transitive tournaments of order pq, where ...
Abstract. Few families of tournaments satisfying the n-e.c. adjacency property are known. We supply ...
AbstractMarušič (Ann. Discrete Math. 27 (1985) 115) proved that all vertex-transitive graphs of orde...
The pursuit to identify vertex-transitive non-Cayley graphs has been deliberate for some time ...
For a positive integer n, does there exist a vertex-transitive graph Γ on n vertices which is not a ...
AbstractIn this paper, we exhibit infinite families of vertex critical r-dichromatic circulant tourn...
Abstract(1). We determine the number of non-isomorphic classes of self-complementary circulant digra...
The first part of this dissertation deals with highly symmetrical combinatorial structures - vertex ...
Let TTk denote the transitive tournament on k vertices. Let TT (h, k) denote the graph obtained from...
We survey results concerning various generalizations of tournaments. The reader will see that tourna...
AbstractA king in a tournament is a vertex which can reach every other vertex via a 1-path or 2-path...
International audienceWe prove the existence of a function $h(k)$ such that every simple digraph wit...
The study of problems concerning subdivisions of graphs has a rich history in extremal combinatorics...
AbstractThis paper completes the determination of all integers of the form pqr (where p, q, and r ar...