|
|||||
|
|
The nonexistence of a (K6‐e)‐decomposition of the complete graph K29 |
|
| Authors: | S G Hartke P R J Östergård D Bryant S I El‐Zanati |
| Institution: | 1. Department of Mathematics, University of Nebraska—Lincoln, Lincoln, Nebraska 68588‐0130;2. Department of Communications and Networking, Helsinki University of Technology TKK, P.O. Box 3000, 02015 TKK, Finland;3. The University of Queensland, Department of Mathematics, Qld 4072, Australia;4. 4520 Mathematics Department, Illinois State University, Normal, Illinois 61790‐4520 |
| Abstract: | We show via an exhaustive computer search that there does not exist a (K6?e)‐decomposition of K29. This is the first example of a non‐complete graph G for which a G‐decomposition of K2|E(G)|+1 does not exist. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 94–104, 2010 |
| Keywords: | backtracking complete graph graph decomposition isomorph rejection |