Pan-partition Transitive Realizations
نویسندگان
چکیده
A tournament is an oriented complete graph. There are many conditions that assure that a non increasing sequence s1 ≥ s2 ≥ ... ≥ sn are the scores (out degrees) of the vertices of a tournament. Furthermore, given a realizable score sequence, there are possibly many tournaments that have that sequence as its score sequence. In this paper we explore the existence of realizations of a sequence having a partition of the vertices, each part of which induces a transitive tournament. This extends work of Brualdi and Shen and Guiduli, Gyárfás, Thomassé and Weidl.
منابع مشابه
Transitive partitions in realizations of tournament score sequences
A tournament is an oriented complete graph, and one containing no directed cycles is called transitive. A tournament T= (V,A) is called m-partition transitive if there is a partition V=X1∪· X2∪· · · ·∪· Xm such that the subtournaments induced by each Xi are all transitive, and T Contract grant sponsor: University of Dayton Research Council (to A. H. B.); Contract grant sponsor: National Science...
متن کاملCompletely Transitive Codes in Hamming Graphs
A code in a graph 0 is a non-empty subset C of the vertex set V of 0. Given C , the partition of V according to the distance of the vertices away from C is called the distance partition of C . A completely regular code is a code whose distance partition has a certain regularity property. A special class of completely regular codes are the completely transitive codes. These are completely regula...
متن کاملOn Poisson Realizations of Transitive Lie Algebroids
We show that every transitive Lie algebroid over a connected symplectic manifold comes from an intrinsic Lie algebroid of a symplectic leaf of a certain Poisson structure. The reconstruction of the corresponding Poisson structures from the Lie algebroid is given in terms of coupling tensors.
متن کاملThe nonexistence of transitive 2-parallelisms of PG(5, 3)
2-spread is a set of 2-dimensional subspaces of PG(d, q), which partition the point set. A 2-parallelism is a partition of the set of 2-dimensional subspaces by 2-spreads. Johnson and Montinaro in their paper ”The transitive t-parallelisms of a finite projective space” point out that the existence of transitive 2-parallelisms of PG(5, 3) is an open question. In the present paper we establish th...
متن کاملPrimitive decompositions of Johnson graphs
A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all transitive decompositions of the Johnson graphs such that the group preserving the partition is arc-transitive and acts primitively on the parts.
متن کامل