The nonexistence of a (K6-e)-decomposition of the complete graph K29
✍ Scribed by S. G. Hartke; P. R. J. Östergård; D. Bryant; S. I. El-Zanati
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 109 KB
- Volume
- 18
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
We show via an exhaustive computer search that there does not exist a (K~6~−e)‐decomposition of K~29~. This is the first example of a non‐complete graph G for which a G‐decomposition of K~2|E(G)|+1~ does not exist. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 94–104, 2010
📜 SIMILAR VOLUMES
## Abstract We consider 2‐factorizations of complete graphs that possess an automorphism group fixing __k__⩾0 vertices and acting sharply transitively on the others. We study the structures of such factorizations and consider the cases in which the group is either abelian or dihedral in some more d
## Abstract A graph is __s‐regular__ if its automorphism group acts freely and transitively on the set of __s__‐arcs. An infinite family of cubic 1‐regular graphs was constructed in [10], as cyclic coverings of the three‐dimensional Hypercube. In this paper, we classify the __s__‐regular cyclic cov
A full classification (up to equivalence) of all complete k-arcs in the Desarguesian projective planes of order 27 and 29 was obtained by computer. The resulting numbers of complete arcs are tabulated according to size of the arc and type of the automorphism group, and also according to the type of
We observe that the values of p for which with high probability Gm,p is k-colorable and for which with high probability G,,p has no k-core are not equal for k 2 4.