Proof about Complete Graph

Revision en1, by snorkel, 2021-05-01 03:05:55

How do I prove that the Complete Graph with $$$n$$$ ($$$n$$$ is even) vertices can have as much as $$$n / 2$$$ disjoint spanning trees (spanning trees that does not share an edge between them)?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English snorkel 2021-05-01 03:05:55 207 Initial revision (published)