PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
sections
Encyclopædia
Papers
Books
Expositions

meta
Requests (236)
Orphanage
Unclass'd (1)
Unproven (540)
Corrections (50)
Classification

talkback
Polls
Forums
Feedback
Bug Reports

downloads
Snapshots
PM Book

information
News
Docs
Wiki
ChangeLog
TODO List
Copyright
About
Owner confidence rating: Low Entry average rating: No information on entry rating
Veblen's theorem (Theorem)

The edge set of a graph can be partitioned into cycles if and only if every vertex has even degree.



"Veblen's theorem" is owned by digitalis.
(view preamble | get metadata)

View style:

See Also: graph, cycle, digraph, directed graph

Keywords:  cycle, graph, partition

Attachments:
proof of Veblen's theorem (Proof) by mathcam
Log in to rate this entry.
(view current ratings)

Cross-references: degree, even, vertex, cycles, graph, edge

This is version 2 of Veblen's theorem, born on 2002-03-07, modified 2002-03-07.
Object id is 2763, canonical name is VeblensTheorem.
Accessed 2445 times total.

Classification:
AMS MSC: 05C38 (Combinatorics :: Graph theory :: Paths and cycles)
Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)