A quick proof that K₁₀P+P+P

DOI10.1016/0012-365X(92)90595-7MaRDI QIDQ1197019zbMATH OpenFDO

Authors D. Hanson

Publication date 16 January 1993

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(92)90595-7

zbMATH Keywords

eigenvaluesPetersen Graphstrongly independent edges

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

There are a number of proofs of the fact that the complete graph on 10 vertices, \(K_{10}\), cannot be factored into three copies of the Petersen Graph, \(P\). These are typically based on certain symmetries of the graph or properties of its eigenvalues. The following short proof of this novelty is based on the existence of strongly independent edges in \(P\) (such edges are mutually at distance at least two).

Recommendations

• scientific article; zbMATH DE number 1744079
• scientific article; zbMATH DE number 5073496
• A proof of Kühnel's conjecture for \(n\geq k^ 2+3k\)
• An extremely simple proof of the K-K-M-S theorem
• A short proof of Kundu's k-factor theorem
• A simple proof of K-K-M-S theorem
• Another elementary proof that \(p(11n+6)\equiv 0\pmod{11}\)
• A note on 3-factorizations of \(K_{10}\)
• A Simple Proof of Fermat's Last Theorem for n = 6 and n = 10

Cited in

(7)

• Spanning cubic graph designs
• The spectrum problem for the connected cubic graphs of order 10
• A short proof of the non-biplanarity of \(K_9\)
• Cubic factorizations
• scientific article; zbMATH DE number 1744079 (Why is no real title available?)
• scientific article; zbMATH DE number 2094528 (Why is no real title available?)
• scientific article; zbMATH DE number 2094532 (Why is no real title available?)

This page was built for publication: A quick proof that \(K_{10}\neq{}P+P+P\)

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