Graph theory partial cleanup
This commit is contained in:
@ -123,5 +123,11 @@ in my class. Isn't it funny that each of them
|
||||
has 5 friends in the class?} \say{This cannot be true,} immediately replies the other girl.
|
||||
How did she know?
|
||||
|
||||
|
||||
\vfill
|
||||
|
||||
\problem{}
|
||||
Say $G$ is a graph with nine vertices. Show that $G$ has at least five vertices of degree six or at least six vertices of degree 5.
|
||||
|
||||
\vfill
|
||||
\pagebreak
|
Reference in New Issue
Block a user