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

DOI10.1016/0012-365X(92)90595-7zbMATH Open0753.05054MaRDI QIDQ1197019FDOQ1197019

Authors: D. Hanson 

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

eigenvaluesPetersen Graphstrongly independent edges

Mathematics Subject Classification ID

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

Cited In (6)

• Spanning cubic graph designs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The spectrum problem for the connected cubic graphs of order 10
• Title not available (Why is that?)
• Cubic factorizations

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)