Triangulating remnants of complete graphs (Q1087891)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Triangulating remnants of complete graphs |
scientific article; zbMATH DE number 3989402
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Triangulating remnants of complete graphs |
scientific article; zbMATH DE number 3989402 |
Statements
Triangulating remnants of complete graphs (English)
0 references
1985
0 references
Let U be a subgraph of \(K_ n\) that is the vertex-disjoint union of cycles and let R be the 'remnant' \(K_ n\setminus U\). This note is concerned with the conjecture that if \(| E(R)| \equiv 0 (mod 3)\) then R can be decomposed into edge-disjoint triangles. It is related to the existence, for n odd, of so-called totally symmetric quasigroups. An example is given \((n=9\) and U is the vertex-disjoint union of \(C_ 4\) and \(C_ 5)\) when the conjecture fails but the possibility that it is true for \(n>9\) remains.
0 references
decomposition
0 references
remnant
0 references
totally symmetric quasigroups
0 references
0.8921989
0 references
0 references
0.8856536
0 references
0.8847574
0 references
0 references
0 references
0.8809686
0 references