Triangulating remnants of complete graphs

MaRDI QIDQ1087891zbMATH OpenFDO

Authors Douglas G. Rogers

Publication date 1985

Published in Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)

zbMATH Keywords

decompositionremnanttotally symmetric quasigroups

Mathematics Subject Classification ID

Graph theory (05C99) Loops, quasigroups (20N05)

Review text

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.

Recommendations

• Decomposition of complete graphs into triangles and claws
• Residually-Complete Graphs
• Graphs of triangulations and perfect matchings
• Generalizations of triangulated graphs
• On existentially complete triangle-free graphs
• Detachments of Complete Graphs
• The partial complement of graphs
• scientific article; zbMATH DE number 3875336
• On Reconstructing Graphs and Their Complements

Cited in

(1)

• Maintenance of triconnected components of graphs

This page was built for publication: Triangulating remnants of complete graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1087891)