Packings and coverings of the complete directed multigraph with 3- and 4-circuits
โ Scribed by F.E. Bennett; J. Yin
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 337 KB
- Volume
- 162
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
Let 2DK~, denote the complete directed multigraph with v vertices, where any two distinct vertices x and y are joined by 2 arcs (x,y) and 2 arcs (y,x). By a k-circuit we mean a directed cycle of length k. In this paper, we consider the problem of finding maximal packings and minimal coverings of 2DKv with k-circuits. In particular, we completely determine the packing number and covering number for the cases k --3 and 4.
๐ SIMILAR VOLUMES
In this paper we find the maximum number of pairwise edgedisjoint m-cycles which exist in a complete graph with n vertices, for all values of n and m with 3 โค m โค n.
## Abstract We prove that the moduli space ๐~3~(1, 1, 4) of polarized abelian threefolds with polarization of type (1, 1, 4) is unirational. By a result of Birkenhake and Lange this implies the unirationality of the isomorphic moduli space ๐~3~(1, 4, 4). The result is based on the study the Hurwitz