Advanced Knowledge Problem of the Week 3-12-19: A Sufficient Condition for a Tree [Graph Theory]

Check out this Advanced Knowledge Problem of the Week.
Be sure to let us know how you solved it in the comments below or on social media!

Solution below.

New Video Series on Graph Theory

This series describes some basic theories in graph theory. We go over some basic definitions in graph theory, what isomorphisms are and what being connected means, eulerian, hamiltonian, Cayley and planar graphs, tournaments and Ramsey numbers. We prove some basic theorems for these various different types of graphs, and prove the existence of the Ramsey number for complete graphs. We give a necessary and sufficient condition for a graph to be eulerian, a sufficient condition to be hamiltonian, and a necessary condition fo a planar graph.

Advanced Knowledge Problem of the Week 2-12-19: Graph with Different Degree Vertices [Graph Theory]

Check out this Advanced Knowledge Problem of the Week.
Be sure to let us know how you solved it in the comments below or on social media!

Solution below.

Advanced Knowledge Problem of the Week: 4-6-1

Check out this week's ADVANCED problem, and let us know how you did in the comments below or on social media!

Solution below the break.

Problem of the Week

Check out this week's Problem of the Week! Let us know how you did in the comments!

Solution below the break.