Understanding Non-Planar Graphs and TK5s

Understanding Non-Planar Graphs and TK5s

Assessment

Interactive Video

Mathematics

9th - 10th Grade

Hard

Created by

Thomas White

FREE Resource

Three mathematicians from Georgia Tech solved a longstanding math mystery by proving the Kelmans-Seymour Conjecture. This video explains the conjecture, which involves graph theory, and introduces basic concepts of graphs, including planar and non-planar graphs. It also explores the significance of TK5 and K5 in graph theory. The proof of the conjecture is complex, spanning 120 pages of mathematical reasoning.

Read more

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Who are the mathematicians mentioned in the video?

Yan, Xingxing, and Dawei

John, Paul, and George

Alice, Bob, and Charlie

Marie, Pierre, and Albert

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the main statement of the Kelmans-Seymour Conjecture?

If a graph is planar, it contains a TK5.

If a graph is five connected and non-planar, it contains a TK5.

If a graph is non-planar, it contains a TK4.

If a graph is five connected, it is planar.

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What are graphs primarily composed of?

Colors and patterns

Shapes like rectangles and circles

Points called vertices and lines called edges

Numbers and equations

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is not a characteristic of graphs?

They are used in graph theory

They are shapes like rectangles

They can be planar or non-planar

They consist of vertices and edges

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What defines a planar graph?

A graph with no vertices

A graph where lines do not cross each other

A graph with only straight lines

A graph with circular edges

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is a characteristic of non-planar graphs?

They are always circular

They have no vertices

They have lines that must cross each other

They have no edges

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is a TK5 in graph theory?

A type of planar graph

A graph with no vertices

A graph with only straight edges

A special non-planar graph

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?