Search the courses, subjects, tracks, games and features, or jump straight to a page.
3 cards from this section. Quick, good the night before a test.
Define a Ramsey number.
Think about friendships among a group.
What is an articulation point in a graph?
Imagine removing a friend from a friend circle.
What is R(3, 3)?
Think about group dynamics!
True or False: A tree with 5 nodes has 6 edges.
Remember the formula for trees.
Create a graph with 10 nodes where every vertex is connected to exactly 4 others. Is it a tree, and if not, why?
Recall that trees must follow specific edge-node relationships.
If a graph is self-complementary with 12 vertices, prove it must have 4k or 4k+1 vertices.
Think about how edges are distributed between complementary graphs.
5 more questions in this section. Enroll free to practise them all.
Enroll free