· quick proof. the sum of the vertex degrees is equal to (a) the total number of vertices, jvj....

Lecture 5: Graphs.

Graphs!

EulerDefinitions: model.Fact!Euler Again!!

Planar graphs.Euler Again!!!!

1 / 20

Lecture 5: Graphs.

Graphs!Euler

Definitions: model.Fact!Euler Again!!

1 / 20

Lecture 5: Graphs.

Graphs!EulerDefinitions: model.

Fact!Euler Again!!

1 / 20

Lecture 5: Graphs.

Graphs!EulerDefinitions: model.Fact!

Euler Again!!Planar graphs.

Euler Again!!!!

1 / 20

Lecture 5: Graphs.

Graphs!EulerDefinitions: model.Fact!Euler Again!!

1 / 20

Lecture 5: Graphs.

1 / 20

Lecture 5: Graphs.

Planar graphs.

Euler Again!!!!

1 / 20

Lecture 5: Graphs.

1 / 20

Konigsberg bridges problem.

Can you make a tour visiting each bridge exactly once?

“Konigsberg bridges” by Bogdan Giusca - License.

Can you draw a tour in the graph where you visit each edge once?

Yes? No?We will see!

2 / 20

Can you draw a tour in the graph where you visit each edge once?Yes?

No?We will see!

2 / 20

Can you draw a tour in the graph where you visit each edge once?Yes? No?

We will see!

2 / 20

Can you draw a tour in the graph where you visit each edge once?Yes? No?We will see!

2 / 20

Graphs: formally.

Graph:

G = (V ,E).V - set of vertices.{A,B,C,D}

E ⊆ V ×V - set of edges.{{A,B},{A,B},{A,C},{B,C},{B,D},{B,D},{C,D}}.

For CS 70, usually simple graphs.No parallel edges.

Multigraph above.

3 / 20

Graphs: formally.

Graph: G = (V ,E).

V - set of vertices.{A,B,C,D}

Multigraph above.

3 / 20

Graphs: formally.

Graph: G = (V ,E).V - set of vertices.

{A,B,C,D}E ⊆ V ×V - set of edges.{{A,B},{A,B},{A,C},{B,C},{B,D},{B,D},{C,D}}.

Multigraph above.

3 / 20

Graphs: formally.

Graph: G = (V ,E).V - set of vertices.{A,B,C,D}

Multigraph above.

3 / 20

Graphs: formally.

E ⊆ V ×V -

set of edges.{{A,B},{A,B},{A,C},{B,C},{B,D},{B,D},{C,D}}.

Multigraph above.

3 / 20

Graphs: formally.

E ⊆ V ×V - set of edges.

{{A,B},{A,B},{A,C},{B,C},{B,D},{B,D},{C,D}}.For CS 70, usually simple graphs.

No parallel edges.Multigraph above.

3 / 20

Graphs: formally.

E ⊆ V ×V - set of edges.{{A,B}

,{A,B},{A,C},{B,C},{B,D},{B,D},{C,D}}.For CS 70, usually simple graphs.

3 / 20

Graphs: formally.

E ⊆ V ×V - set of edges.{{A,B},{A,B}

,{A,C},{B,C},{B,D},{B,D},{C,D}}.For CS 70, usually simple graphs.

3 / 20

Graphs: formally.

E ⊆ V ×V - set of edges.{{A,B},{A,B},{A,C},

{B,C},{B,D},{B,D},{C,D}}.For CS 70, usually simple graphs.

3 / 20

Graphs: formally.

Multigraph above.

3 / 20

Graphs: formally.

For CS 70, usually simple graphs.

3 / 20

Graphs: formally.

Multigraph above.

3 / 20

Graphs: formally.

Multigraph above.

3 / 20

Directed Graphs

G = (V ,E).

V - set of vertices.{1,2,3,4}

E ordered pairs of vertices.{(1,2),(1,3),(1,4),(2,4),(3,4)}

One way streets.Tournament: 1 beats 2, ...Precedence: 1 is before 2, ..

Social Network: Directed? Undirected?Friends. Undirected.Likes. Directed.

Sometimes both ways!

4 / 20

Directed Graphs

G = (V ,E).V - set of vertices.

{1,2,3,4}E ordered pairs of vertices.{(1,2),(1,3),(1,4),(2,4),(3,4)}

4 / 20

Directed Graphs

G = (V ,E).V - set of vertices.{1,2,3,4}

4 / 20

Directed Graphs

E ordered pairs of vertices.

{(1,2),(1,3),(1,4),(2,4),(3,4)}

4 / 20

Directed Graphs

E ordered pairs of vertices.{(1,2),

(1,3),(1,4),(2,4),(3,4)}

4 / 20

Directed Graphs

E ordered pairs of vertices.{(1,2),(1,3),

(1,4),(2,4),(3,4)}

4 / 20

Directed Graphs

E ordered pairs of vertices.{(1,2),(1,3),(1,4),

(2,4),(3,4)}

4 / 20

Directed Graphs

4 / 20

Directed Graphs

One way streets.

Tournament: 1 beats 2, ...Precedence: 1 is before 2, ..

4 / 20

Directed Graphs

One way streets.Tournament:

1 beats 2, ...Precedence: 1 is before 2, ..

4 / 20

Directed Graphs

One way streets.Tournament: 1 beats 2,

...Precedence: 1 is before 2, ..

4 / 20

Directed Graphs

One way streets.Tournament: 1 beats 2, ...Precedence:

1 is before 2, ..

4 / 20

Directed Graphs

One way streets.Tournament: 1 beats 2, ...Precedence: 1 is before 2,

4 / 20

Directed Graphs

4 / 20

Directed Graphs

Social Network:

Directed? Undirected?Friends. Undirected.Likes. Directed.

4 / 20

Directed Graphs

Social Network: Directed?

Undirected?Friends. Undirected.Likes. Directed.

4 / 20

Directed Graphs

Social Network: Directed? Undirected?

Friends. Undirected.Likes. Directed.

4 / 20

Directed Graphs

Social Network: Directed? Undirected?Friends.

Undirected.Likes. Directed.

4 / 20

Directed Graphs

Social Network: Directed? Undirected?Friends. Undirected.

Likes. Directed.Sometimes both ways!

4 / 20

Directed Graphs

Social Network: Directed? Undirected?Friends. Undirected.Likes.

Directed.Sometimes both ways!

4 / 20

Directed Graphs

4 / 20

Directed Graphs

4 / 20

Graph Concepts and Definitions.Graph: G = (V ,E)

neighbors, adjacent, degree, incident, in-degree, out-degree

Neighbors of 10? 1, 5, 7, 8.u is neighbor of v if {u,v} ∈ E .

Edge {10,5} is incident to vertex 10 and vertex 5.Edge {u,v} is incident to u and v .

Degree of vertex 1? 2Degree of vertex u is number of incident edges.Equals number of neighbors in simple graph.

Directed graph?In-degree of 10? 1 Out-degree of 10? 3

5 / 20

Neighbors of 10?

1, 5, 7, 8.u is neighbor of v if {u,v} ∈ E .

5 / 20

Neighbors of 10? 1,

5, 7, 8.u is neighbor of v if {u,v} ∈ E .

5 / 20

Neighbors of 10? 1, 5,

7, 8.u is neighbor of v if {u,v} ∈ E .

5 / 20

Neighbors of 10? 1, 5, 7,

8.u is neighbor of v if {u,v} ∈ E .

5 / 20

Neighbors of 10? 1, 5, 7, 8.

u is neighbor of v if {u,v} ∈ E .Edge {10,5} is incident to vertex 10 and vertex 5.

Edge {u,v} is incident to u and v .Degree of vertex 1? 2

Degree of vertex u is number of incident edges.Equals number of neighbors in simple graph.

5 / 20

Edge {10,5} is incident to

vertex 10 and vertex 5.Edge {u,v} is incident to u and v .

5 / 20

Degree of vertex 1?

2Degree of vertex u is number of incident edges.Equals number of neighbors in simple graph.

5 / 20

Degree of vertex 1? 2

Degree of vertex u is number of incident edges.Equals number of neighbors in simple graph.

5 / 20

Degree of vertex 1? 2Degree of vertex u is number of incident edges.

Equals number of neighbors in simple graph.

5 / 20

Directed graph?

In-degree of 10? 1 Out-degree of 10? 3

5 / 20

Directed graph?In-degree of 10?

1 Out-degree of 10? 3

5 / 20

Directed graph?In-degree of 10? 1

Out-degree of 10? 3

5 / 20

Directed graph?In-degree of 10? 1 Out-degree of 10?

5 / 20

Quick Proof.The sum of the vertex degrees is equal to

(A) the total number of vertices, |V |.(B) the total number of edges, |E |.(C) What?

Not (A)! Triangle.

Not (B)! Triangle.

What? For triangle number of edges is 3, the sum of degrees is 6.

Could it always be...2|E |? ..or 2|V |?How many incidences does each edge contribute? 2.

2|E | incidences are contributed in total!What is degree v? incidences contributed to v !sum of degrees is total incidences ... or 2|E |.

Thm: Sum of vertex degress is 2|E |.

6 / 20

(A) the total number of vertices, |V |.

(B) the total number of edges, |E |.(C) What?

Not (A)! Triangle.

Not (B)! Triangle.

6 / 20

(A) the total number of vertices, |V |.(B) the total number of edges, |E |.

(C) What?

Not (A)! Triangle.

Not (B)! Triangle.

6 / 20

Not (A)! Triangle.

Not (B)! Triangle.

6 / 20

Not (A)!

Triangle.

Not (B)! Triangle.

6 / 20

Not (A)! Triangle.

Not (B)! Triangle.

6 / 20

Not (A)! Triangle.

Not (B)!

Triangle.

6 / 20

Not (A)! Triangle.

Not (B)! Triangle.

6 / 20

Not (A)! Triangle.

Not (B)! Triangle.

6 / 20

Not (A)! Triangle.

Not (B)! Triangle.

For triangle number of edges is 3, the sum of degrees is 6.

6 / 20

Not (A)! Triangle.

Not (B)! Triangle.

6 / 20

Not (A)! Triangle.

Not (B)! Triangle.

Could it always be...

2|E |? ..or 2|V |?How many incidences does each edge contribute? 2.

6 / 20

Not (A)! Triangle.

Not (B)! Triangle.

Could it always be...2|E |? ..

or 2|V |?How many incidences does each edge contribute? 2.

6 / 20

Not (A)! Triangle.

Not (B)! Triangle.

Could it always be...2|E |? ..or 2|V |?

How many incidences does each edge contribute? 2.2|E | incidences are contributed in total!

What is degree v? incidences contributed to v !sum of degrees is total incidences ... or 2|E |.

6 / 20

Not (A)! Triangle.

Not (B)! Triangle.

Could it always be...2|E |? ..or 2|V |?How many incidences does each edge contribute?

2.2|E | incidences are contributed in total!

6 / 20

Not (A)! Triangle.

Not (B)! Triangle.

6 / 20

Not (A)! Triangle.

Not (B)! Triangle.

2|E | incidences are contributed in total!

6 / 20

Not (A)! Triangle.

Not (B)! Triangle.

2|E | incidences are contributed in total!What is degree v?

incidences contributed to v !sum of degrees is total incidences ... or 2|E |.

6 / 20

Not (A)! Triangle.

Not (B)! Triangle.

2|E | incidences are contributed in total!What is degree v? incidences contributed to v !

sum of degrees is total incidences ... or 2|E |.Thm: Sum of vertex degress is 2|E |.

6 / 20

Not (A)! Triangle.

Not (B)! Triangle.

2|E | incidences are contributed in total!What is degree v? incidences contributed to v !sum of degrees is total incidences

... or 2|E |.Thm: Sum of vertex degress is 2|E |.

6 / 20

Not (A)! Triangle.

Not (B)! Triangle.

6 / 20

Not (A)! Triangle.

Not (B)! Triangle.

6 / 20

Paths, walks, cycles, tour.

A path in a graph is a sequence of edges.

Path? {1,10}, {8,5}, {4,5} ? No!Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!

Path: (v1,v2),(v2,v3), . . .(vk−1,vk ).Quick Check! Length of path? k vertices or k −1 edges.

Cycle: Path with v1 = vk . Length of cycle? k −1 vertices and edges!Path is usually simple. No repeated vertex!

Walk is sequence of edges with possible repeated vertex or edge.Tour is walk that starts and ends at the same node.

Quick Check!Path is to Walk as Cycle is to ?? Tour!

7 / 20

{1,10}, {8,5}, {4,5} ? No!Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!

7 / 20

Path? {1,10}, {8,5}, {4,5} ?

No!Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!

7 / 20

Path? {1,10}, {8,5}, {4,5} ? No!

Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!Path: (v1,v2),(v2,v3), . . .(vk−1,vk ).

Quick Check! Length of path? k vertices or k −1 edges.Cycle: Path with v1 = vk . Length of cycle? k −1 vertices and edges!Path is usually simple. No repeated vertex!

7 / 20

Path? {1,10}, {8,5}, {4,5} ? No!Path?

{1,10}, {10,5}, {5,4}, {4,11}? Yes!Path: (v1,v2),(v2,v3), . . .(vk−1,vk ).

7 / 20

Path? {1,10}, {8,5}, {4,5} ? No!Path? {1,10}, {10,5}, {5,4}, {4,11}?

Yes!Path: (v1,v2),(v2,v3), . . .(vk−1,vk ).

7 / 20

Path? {1,10}, {8,5}, {4,5} ? No!Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!

7 / 20

Path? {1,10}, {8,5}, {4,5} ? No!Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!

Path: (v1,v2),(v2,v3), . . .(vk−1,vk ).

7 / 20

Path? {1,10}, {8,5}, {4,5} ? No!Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!

Path: (v1,v2),(v2,v3), . . .(vk−1,vk ).Quick Check!

Length of path? k vertices or k −1 edges.Cycle: Path with v1 = vk . Length of cycle? k −1 vertices and edges!Path is usually simple. No repeated vertex!

7 / 20

Path? {1,10}, {8,5}, {4,5} ? No!Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!

Path: (v1,v2),(v2,v3), . . .(vk−1,vk ).Quick Check! Length of path?

k vertices or k −1 edges.Cycle: Path with v1 = vk . Length of cycle? k −1 vertices and edges!Path is usually simple. No repeated vertex!

7 / 20

Path? {1,10}, {8,5}, {4,5} ? No!Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!

Path: (v1,v2),(v2,v3), . . .(vk−1,vk ).Quick Check! Length of path? k vertices

or k −1 edges.Cycle: Path with v1 = vk . Length of cycle? k −1 vertices and edges!Path is usually simple. No repeated vertex!

7 / 20

Path? {1,10}, {8,5}, {4,5} ? No!Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!

7 / 20

Path? {1,10}, {8,5}, {4,5} ? No!Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!

Cycle: Path with v1 = vk .

Length of cycle? k −1 vertices and edges!Path is usually simple. No repeated vertex!

7 / 20

Path? {1,10}, {8,5}, {4,5} ? No!Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!

Cycle: Path with v1 = vk . Length of cycle?

k −1 vertices and edges!Path is usually simple. No repeated vertex!

7 / 20

Path? {1,10}, {8,5}, {4,5} ? No!Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!

Cycle: Path with v1 = vk . Length of cycle? k −1 vertices and edges!

Path is usually simple. No repeated vertex!Walk is sequence of edges with possible repeated vertex or edge.Tour is walk that starts and ends at the same node.

7 / 20

Path? {1,10}, {8,5}, {4,5} ? No!Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!

Cycle: Path with v1 = vk . Length of cycle? k −1 vertices and edges!Path is usually simple.

No repeated vertex!Walk is sequence of edges with possible repeated vertex or edge.Tour is walk that starts and ends at the same node.

7 / 20

Path? {1,10}, {8,5}, {4,5} ? No!Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!

7 / 20

Path? {1,10}, {8,5}, {4,5} ? No!Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!

Walk is sequence of edges with possible repeated vertex or edge.

Tour is walk that starts and ends at the same node.

7 / 20

Path? {1,10}, {8,5}, {4,5} ? No!Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!

Walk is sequence of edges with possible repeated vertex or edge.

Tour is walk that starts and ends at the same node.

7 / 20

Path? {1,10}, {8,5}, {4,5} ? No!Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!

7 / 20

Path? {1,10}, {8,5}, {4,5} ? No!Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!

7 / 20

Path? {1,10}, {8,5}, {4,5} ? No!Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!

Quick Check!

Path is to Walk as Cycle is to ?? Tour!

7 / 20

Path? {1,10}, {8,5}, {4,5} ? No!Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!

Quick Check!Path is to Walk as Cycle is to ??

7 / 20

Path? {1,10}, {8,5}, {4,5} ? No!Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!

7 / 20

Path? {1,10}, {8,5}, {4,5} ? No!Path? {1,10}, {10,5}, {5,4}, {4,11}? Yes!

7 / 20

Directed Paths.

Path: (v1,v2),(v2,v3), . . .(vk−1,vk ).Paths, walks, cycles, tours ... are analagous to undirected now.

8 / 20

Directed Paths.

Path: (v1,v2),(v2,v3), . . .(vk−1,vk ).

Paths, walks, cycles, tours ... are analagous to undirected now.

8 / 20

Directed Paths.

Path: (v1,v2),(v2,v3), . . .(vk−1,vk ).

8 / 20

Directed Paths.

Path: (v1,v2),(v2,v3), . . .(vk−1,vk ).

8 / 20

Directed Paths.

Path: (v1,v2),(v2,v3), . . .(vk−1,vk ).

8 / 20

Directed Paths.

Path: (v1,v2),(v2,v3), . . .(vk−1,vk ).Paths,

walks, cycles, tours ... are analagous to undirected now.

8 / 20

Directed Paths.

Path: (v1,v2),(v2,v3), . . .(vk−1,vk ).Paths, walks,

cycles, tours ... are analagous to undirected now.

8 / 20

Directed Paths.

Path: (v1,v2),(v2,v3), . . .(vk−1,vk ).Paths, walks, cycles,

tours ... are analagous to undirected now.

8 / 20

Directed Paths.

Path: (v1,v2),(v2,v3), . . .(vk−1,vk ).Paths, walks, cycles, tours

... are analagous to undirected now.

8 / 20

Directed Paths.

Path: (v1,v2),(v2,v3), . . .(vk−1,vk ).Paths, walks, cycles, tours ... are analagous to undirected now.

8 / 20

Connectivity: undirected graph.

u and v are connected if there is a path (or walk) between u and v .

A connected graph is a graph where all pairs of vertices areconnected.

If one vertex x is connected to every other vertex.Is graph connected? Yes? No?

Proof:Any u,v : path from u to x and then from x to v is u−v walk.

May not be simple!Either modify definition to walk.Or cut out cycles. .

9 / 20

If one vertex x is connected to every other vertex.

Is graph connected? Yes? No?

9 / 20

If one vertex x is connected to every other vertex.Is graph connected?

Yes? No?

9 / 20

If one vertex x is connected to every other vertex.Is graph connected? Yes?

9 / 20

Proof:

Any u,v : path from u to x and then from x to v is u−v walk.

9 / 20

Proof:Any u,v :

path from u to x and then from x to v is u−v walk.

9 / 20

May not be simple!

Either modify definition to walk.Or cut out cycles. .

9 / 20

May not be simple!Either modify definition to walk.

Or cut out cycles. .

9 / 20

May not be simple!Either modify definition to walk.Or cut out cycles.

9 / 20

Connected Components

Is graph above connected?

How about now? No!

Connected Components? {1},{10,7,5,8,4,3,11},{2,9,6}.Connected component - maximal set of connected vertices.

Quick Check: Is {10,7,5} a connected component? No.

10 / 20

Is graph above connected? Yes!

How about now? No!

10 / 20

How about now?

10 / 20

How about now? No!

10 / 20

How about now? No!

Connected Components?

{1},{10,7,5,8,4,3,11},{2,9,6}.Connected component - maximal set of connected vertices.

10 / 20

How about now? No!

Connected Components? {1},{10,7,5,8,4,3,11},{2,9,6}.

Connected component - maximal set of connected vertices.Quick Check: Is {10,7,5} a connected component? No.

10 / 20

How about now? No!

10 / 20

How about now? No!

Quick Check: Is {10,7,5} a connected component?

10 / 20

How about now? No!

10 / 20

Finally..back to Euler!

An Eulerian Tour is a tour that visits each edge exactly once.

Theorem: Any undirected graph has an Eulerian tour if and only if allvertices have even degree and is connected.Proof of only if: Eulerian =⇒ connected and all even degree.

Eulerian Tour is connected so graph is connected.Tour enters and leaves vertex v on each visit.Uses two incident edges per visit. Tour uses all incident edges.Therefore v has even degree.

When you enter, you can leave.For starting node, tour leaves first ....then enters at end.

Not The Hotel California.

11 / 20

Theorem: Any undirected graph has an Eulerian tour if and only if allvertices have even degree and is connected.

Proof of only if: Eulerian =⇒ connected and all even degree.

11 / 20

Eulerian Tour is connected so graph is connected.

Tour enters and leaves vertex v on each visit.Uses two incident edges per visit. Tour uses all incident edges.Therefore v has even degree.

11 / 20

Eulerian Tour is connected so graph is connected.Tour enters and leaves vertex v on each visit.

Uses two incident edges per visit. Tour uses all incident edges.Therefore v has even degree.

11 / 20

Eulerian Tour is connected so graph is connected.Tour enters and leaves vertex v on each visit.Uses two incident edges per visit.

Tour uses all incident edges.Therefore v has even degree.

11 / 20

Eulerian Tour is connected so graph is connected.Tour enters and leaves vertex v on each visit.Uses two incident edges per visit. Tour uses all incident edges.

Therefore v has even degree.

11 / 20

When you enter,

you can leave.For starting node, tour leaves first ....then enters at end.

11 / 20

When you enter, you can leave.

For starting node, tour leaves first ....then enters at end.Not The Hotel California.

11 / 20

When you enter, you can leave.For starting node,

tour leaves first ....then enters at end.Not The Hotel California.

11 / 20

When you enter, you can leave.For starting node, tour leaves first

....then enters at end.Not The Hotel California.

11 / 20

Finding a tour!

Proof of if: Even + connected =⇒ Eulerian Tour.We will give an algorithm.

First by picture.

1. Start walk from v (1) on “unused” edges... till you get back to v .2. Remove tour, C.3. Let G1, . . . ,Gk be connected components.

Each is touched by C: Vi ∩C 6= φ .Why? G was connected.

Let vi be (first) node in Gi touched by C.Example: v1 = 1, v2 = 10, v3 = 4, v4 = 2.

4. Recurse on G1, . . . ,Gk starting from vi5. Splice together.

1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

Proof of if: Even + connected =⇒ Eulerian Tour.We will give an algorithm. First by picture.

1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

1. Start walk from v (1) on “unused” edges

... till you get back to v .2. Remove tour, C.3. Let G1, . . . ,Gk be connected components.

1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

1. Start walk from v (1) on “unused” edges... till you get back to v .

2. Remove tour, C.3. Let G1, . . . ,Gk be connected components.

1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

1. Start walk from v (1) on “unused” edges... till you get back to v .2. Remove tour, C.

3. Let G1, . . . ,Gk be connected components.Each is touched by C: Vi ∩C 6= φ .

Why? G was connected.Let vi be (first) node in Gi touched by C.

Example: v1 = 1, v2 = 10, v3 = 4, v4 = 2.4. Recurse on G1, . . . ,Gk starting from vi5. Splice together.

1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

Each is touched by C: Vi ∩C 6= φ .

Why? G was connected.Let vi be (first) node in Gi touched by C.

1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

Each is touched by C: Vi ∩C 6= φ .Why?

G was connected.Let vi be (first) node in Gi touched by C.

1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

Let vi be (first) node in Gi touched by C.

1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

Let vi be (first) node in Gi touched by C.Example: v1 = 1,

v2 = 10, v3 = 4, v4 = 2.4. Recurse on G1, . . . ,Gk starting from vi5. Splice together.

1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

Let vi be (first) node in Gi touched by C.Example: v1 = 1, v2 = 10,

v3 = 4, v4 = 2.4. Recurse on G1, . . . ,Gk starting from vi5. Splice together.

1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

Let vi be (first) node in Gi touched by C.Example: v1 = 1, v2 = 10, v3 = 4,

v4 = 2.4. Recurse on G1, . . . ,Gk starting from vi5. Splice together.

1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

4. Recurse on G1, . . . ,Gk starting from vi

5. Splice together.1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

4. Recurse on G1, . . . ,Gk starting from vi

5. Splice together.1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

1,10,7,8,5,10

,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

1,10,7,8,5,10 ,8,4

,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

1,10,7,8,5,10 ,8,4,3,11,4

5,2,6,9,2 and to 1!

12 / 20

Finding a tour!

1,10,7,8,5,10 ,8,4,3,11,4 5,2

,6,9,2 and to 1!

12 / 20

Finding a tour!

1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2

and to 1!

12 / 20

Finding a tour!

1,10,7,8,5,10 ,8,4,3,11,4 5,2,6,9,2 and to 1!

12 / 20

Recursive/Inductive Algorithm.1. Take a walk from arbitrary node v , until you get back to v .

Claim: Do get back to v !Proof of Claim: Even degree. If enter, can leave except for v .

2. Remove cycle, C, from G.Resulting graph may be disconnected. (Removed edges!)Let components be G1, . . . ,Gk .Let vi be first vertex of C that is in Gi .

Why is there a vi in C?G was connected =⇒

a vertex in Gi must be incident to a removed edge in C.

Claim: Each vertex in each Gi has even degree and is connected.Prf: Tour C has even incidences to any vertex v .

3. Find tour Ti of Gi starting/ending at vi . Induction.4. Splice Ti into C where vi first appears in C.

Visits every edge once:Visits edges in C exactly once.By induction for all edges in each Gi .

13 / 20

Claim: Do get back to v !

Proof of Claim: Even degree. If enter, can leave except for v .

13 / 20

Claim: Do get back to v !Proof of Claim: Even degree.

If enter, can leave except for v .

13 / 20

Claim: Do get back to v !Proof of Claim: Even degree. If enter, can leave

except for v .

13 / 20

2. Remove cycle, C, from G.

Resulting graph may be disconnected. (Removed edges!)Let components be G1, . . . ,Gk .Let vi be first vertex of C that is in Gi .

13 / 20

2. Remove cycle, C, from G.Resulting graph may be disconnected. (Removed edges!)

Let components be G1, . . . ,Gk .Let vi be first vertex of C that is in Gi .

13 / 20

2. Remove cycle, C, from G.Resulting graph may be disconnected. (Removed edges!)Let components be G1, . . . ,Gk .

Let vi be first vertex of C that is in Gi .Why is there a vi in C?

G was connected =⇒a vertex in Gi must be incident to a removed edge in C.

13 / 20

Why is there a vi in C?

G was connected =⇒a vertex in Gi must be incident to a removed edge in C.

13 / 20

Claim: Each vertex in each Gi has even degree

and is connected.Prf: Tour C has even incidences to any vertex v .

13 / 20

Claim: Each vertex in each Gi has even degree and is connected.

Prf: Tour C has even incidences to any vertex v .

13 / 20

3. Find tour Ti of Gi

starting/ending at vi . Induction.4. Splice Ti into C where vi first appears in C.

13 / 20

3. Find tour Ti of Gi starting/ending at vi .

Induction.4. Splice Ti into C where vi first appears in C.

13 / 20

3. Find tour Ti of Gi starting/ending at vi . Induction.

4. Splice Ti into C where vi first appears in C.

13 / 20

Visits every edge once:Visits edges in C

exactly once.By induction for all edges in each Gi .

13 / 20

Visits every edge once:Visits edges in C exactly once.

By induction for all edges in each Gi .

13 / 20

Break time!

Well admin time!

Must choose homework option or test only: soon after recieving hw 1scores.

Test Option: don’t have to do homework. Yes!!Should do homework. No need to write up.

Homework Option: have to do homework. Bummer!

The truth: mostly test, both options!Variance mostly in exams for A/B range.most homework students get near perfect scores on homework.

How will I do?

Mostly up to you.

14 / 20

Break time!

Well admin time!

How will I do?

Mostly up to you.

14 / 20

Break time!

Well admin time!

Test Option: don’t have to do homework.

Yes!!Should do homework. No need to write up.

How will I do?

Mostly up to you.

14 / 20

Break time!

Well admin time!

Test Option: don’t have to do homework. Yes!!

Should do homework. No need to write up.Homework Option: have to do homework. Bummer!

How will I do?

Mostly up to you.

14 / 20

Break time!

Well admin time!

Test Option: don’t have to do homework. Yes!!Should do homework.

No need to write up.Homework Option: have to do homework. Bummer!

How will I do?

Mostly up to you.

14 / 20

Break time!

Well admin time!

How will I do?

Mostly up to you.

14 / 20

Break time!

Well admin time!

Homework Option: have to do homework.

Bummer!

How will I do?

Mostly up to you.

14 / 20

Break time!

Well admin time!

How will I do?

Mostly up to you.

14 / 20

Break time!

Well admin time!

How will I do?

Mostly up to you.

14 / 20

Break time!

Well admin time!

The truth:

mostly test, both options!Variance mostly in exams for A/B range.most homework students get near perfect scores on homework.

How will I do?

Mostly up to you.

14 / 20

Break time!

Well admin time!

The truth: mostly test,

both options!Variance mostly in exams for A/B range.most homework students get near perfect scores on homework.

How will I do?

Mostly up to you.

14 / 20

Break time!

Well admin time!

The truth: mostly test, both options!

Variance mostly in exams for A/B range.most homework students get near perfect scores on homework.

How will I do?

Mostly up to you.

14 / 20

Break time!

Well admin time!

The truth: mostly test, both options!Variance mostly in exams for A/B range.

most homework students get near perfect scores on homework.

How will I do?

Mostly up to you.

14 / 20

Break time!

Well admin time!

How will I do?

Mostly up to you.

14 / 20

Break time!

Well admin time!

How will I do?

Mostly up to you.

14 / 20

Break time!

Well admin time!

How will I do?

Mostly up to you.

14 / 20

Break time!

Well admin time!

How will I do?

Mostly up to you.

14 / 20

Planar graphs.A graph that can be drawn in the plane without edge crossings.

Planar? Yes for Triangle.Four node complete? Yes.

Note: Complete means every possible edge is present, also clique.Five node complete or K5? No! Why? Later.

Two to three nodes, bipartite? Yes.Three to three nodes, complete/bipartite or K3,3. No. Why? Later.

15 / 20

Planar?

Yes for Triangle.Four node complete? Yes.

15 / 20

Planar? Yes for Triangle.

Four node complete? Yes.Note: Complete means every possible edge is present, also clique.

Five node complete or K5? No! Why? Later.

15 / 20

Planar? Yes for Triangle.Four node complete?

Yes.Note: Complete means every possible edge is present, also clique.

15 / 20

Note: Complete means every possible edge is present, also clique.

15 / 20

Note: Complete means every possible edge is present, also clique.Five node complete or K5?

No! Why? Later.

15 / 20

Note: Complete means every possible edge is present, also clique.Five node complete or K5? No!

Why? Later.

15 / 20

Note: Complete means every possible edge is present, also clique.Five node complete or K5? No! Why?

Later.

15 / 20

Two to three nodes, bipartite?

Yes.Three to three nodes, complete/bipartite or K3,3. No. Why? Later.

15 / 20

Two to three nodes, bipartite? Yes.

Three to three nodes, complete/bipartite or K3,3. No. Why? Later.

15 / 20

Two to three nodes, bipartite? Yes.Three to three nodes, complete/bipartite or K3,3.

No. Why? Later.

15 / 20

Two to three nodes, bipartite? Yes.Three to three nodes, complete/bipartite or K3,3. No.

Why? Later.

15 / 20

Two to three nodes, bipartite? Yes.Three to three nodes, complete/bipartite or K3,3. No. Why?

Later.

15 / 20

Euler’s Formula.

Faces: connected regions of the plane.

How many faces fortriangle? 2complete on four vertices or K4? 4bipartite, complete two/three or K2,3? 3

v is number of vertices, e is number of edges, f is number of faces.

Euler’s Formula: Connected planar graph has v + f = e+2.

Triangle: 3+2 = 3+2!K4: 4+4 = 6+2!K2,3: 5+3 = 6+2!

Examples = 3! Proven! Not!!!!

16 / 20

Euler’s Formula.

Triangle: 3+2 = 3+2!K4: 4+4 = 6+2!K2,3: 5+3 = 6+2!

16 / 20

Euler’s Formula.

How many faces for

triangle? 2complete on four vertices or K4? 4bipartite, complete two/three or K2,3? 3

Triangle: 3+2 = 3+2!K4: 4+4 = 6+2!K2,3: 5+3 = 6+2!

16 / 20

Euler’s Formula.

How many faces fortriangle?

2complete on four vertices or K4? 4bipartite, complete two/three or K2,3? 3

Triangle: 3+2 = 3+2!K4: 4+4 = 6+2!K2,3: 5+3 = 6+2!

16 / 20

Euler’s Formula.

How many faces fortriangle? 2

complete on four vertices or K4? 4bipartite, complete two/three or K2,3? 3

Triangle: 3+2 = 3+2!K4: 4+4 = 6+2!K2,3: 5+3 = 6+2!

16 / 20

Euler’s Formula.

How many faces fortriangle? 2complete on four vertices or K4?

4bipartite, complete two/three or K2,3? 3

Triangle: 3+2 = 3+2!K4: 4+4 = 6+2!K2,3: 5+3 = 6+2!

16 / 20

Euler’s Formula.

How many faces fortriangle? 2complete on four vertices or K4? 4

bipartite, complete two/three or K2,3? 3

Triangle: 3+2 = 3+2!K4: 4+4 = 6+2!K2,3: 5+3 = 6+2!

16 / 20

Euler’s Formula.

How many faces fortriangle? 2complete on four vertices or K4? 4bipartite, complete two/three or K2,3?

Triangle: 3+2 = 3+2!K4: 4+4 = 6+2!K2,3: 5+3 = 6+2!

16 / 20

Euler’s Formula.

Triangle: 3+2 = 3+2!K4: 4+4 = 6+2!K2,3: 5+3 = 6+2!

16 / 20

Euler’s Formula.

Triangle: 3+2 = 3+2!K4: 4+4 = 6+2!K2,3: 5+3 = 6+2!

16 / 20

Euler’s Formula.

Triangle: 3+2 = 3+2!K4: 4+4 = 6+2!K2,3: 5+3 = 6+2!

16 / 20

Euler’s Formula.

Triangle: 3+2 = 3+2!K4: 4+4 = 6+2!K2,3: 5+3 = 6+2!

16 / 20

Euler’s Formula.

Triangle: 3+2 = 3+2!K4: 4+4 = 6+2!K2,3: 5+3 = 6+2!

16 / 20

Euler’s Formula.

Triangle:

3+2 = 3+2!K4: 4+4 = 6+2!K2,3: 5+3 = 6+2!

16 / 20

Euler’s Formula.

Triangle: 3+2 = 3+2!

K4: 4+4 = 6+2!K2,3: 5+3 = 6+2!

16 / 20

Euler’s Formula.

Triangle: 3+2 = 3+2!K4:

4+4 = 6+2!K2,3: 5+3 = 6+2!

16 / 20

Euler’s Formula.

Triangle: 3+2 = 3+2!K4: 4+4 = 6+2!

K2,3: 5+3 = 6+2!

16 / 20

Euler’s Formula.

Triangle: 3+2 = 3+2!K4: 4+4 = 6+2!K2,3:

5+3 = 6+2!

16 / 20

Euler’s Formula.

Triangle: 3+2 = 3+2!K4: 4+4 = 6+2!K2,3: 5+3 = 6+2!

16 / 20

Euler’s Formula.

Triangle: 3+2 = 3+2!K4: 4+4 = 6+2!K2,3: 5+3 = 6+2!

16 / 20

Euler’s Formula.

Triangle: 3+2 = 3+2!K4: 4+4 = 6+2!K2,3: 5+3 = 6+2!

Examples = 3!

Proven! Not!!!!

16 / 20

Euler’s Formula.

Triangle: 3+2 = 3+2!K4: 4+4 = 6+2!K2,3: 5+3 = 6+2!

Examples = 3! Proven!

Not!!!!

16 / 20

Euler’s Formula.

Triangle: 3+2 = 3+2!K4: 4+4 = 6+2!K2,3: 5+3 = 6+2!

16 / 20

Euler and Polyhedron.Greeks knew formula for convex polyhedron.

Faces? 6. Edges? 12. Vertices? 8.

Euler: Connected planar graph: v + f = e+2.8+6 = 12+2.

Greeks couldn’t prove it. Induction? Remove vertice for polyhedron?

Convex Polyhedron without holes ≡ Planar graphs.

Surround by sphere.Project from point inside polytope onto sphere.Sphere ≡ Plane! Topologically.

Euler proved formula thousands of years later!

17 / 20

Faces?

6. Edges? 12. Vertices? 8.

17 / 20

Faces? 6. Edges?

12. Vertices? 8.

17 / 20

Faces? 6. Edges? 12.

Vertices? 8.

17 / 20

Faces? 6. Edges? 12. Vertices?

17 / 20

Euler: Connected planar graph: v + f = e+2.

8+6 = 12+2.

17 / 20

Euler: Connected planar graph: v + f = e+2.

8+6 = 12+2.

17 / 20

Greeks couldn’t prove it.

Induction? Remove vertice for polyhedron?

17 / 20

Greeks couldn’t prove it. Induction?

Remove vertice for polyhedron?

17 / 20

Convex Polyhedron without holes

≡ Planar graphs.

17 / 20

Convex Polyhedron without holes ≡

Planar graphs.

17 / 20

Surround by sphere.

Project from point inside polytope onto sphere.Sphere ≡ Plane! Topologically.

17 / 20

Surround by sphere.Project from point inside polytope onto sphere.

Sphere ≡ Plane! Topologically.

17 / 20

Surround by sphere.Project from point inside polytope onto sphere.Sphere

≡ Plane! Topologically.

17 / 20

Surround by sphere.Project from point inside polytope onto sphere.Sphere ≡ Plane!

Topologically.

17 / 20

Euler proved formula thousands of years later!17 / 20

Euler and non-planarity of K5 and K3,3

Euler: v + f = e+2 for connected planar graph.We consider simple graphs where v ≥ 3.Consider Face edge Adjacencies.

Each face is adjacent to at least three edges.≥ 3f face-edge adjacencies.

Each edge is adjacent to (at most) two faces.≤ 2e face-edge adjacencies.

=⇒ 3f ≤ 2e for any planar graph. Or f ≤ 23e.

Plug into Euler: v + 23e ≥ e+2 =⇒ e ≤ 3v −6

K5 Edges? 4+3+2+1 = 10. Vertices? 5.10 6≤ 3(5)−6 = 9. =⇒ K5 is not planar.

18 / 20

Euler: v + f = e+2 for connected planar graph.

We consider simple graphs where v ≥ 3.Consider Face edge Adjacencies.

18 / 20

Euler: v + f = e+2 for connected planar graph.We consider simple graphs where v ≥ 3.

Consider Face edge Adjacencies.

18 / 20

Each face is adjacent to at least three edges.

≥ 3f face-edge adjacencies.Each edge is adjacent to (at most) two faces.

≤ 2e face-edge adjacencies.=⇒ 3f ≤ 2e for any planar graph. Or f ≤ 2

18 / 20

Each edge is adjacent to (at most) two faces.

≤ 2e face-edge adjacencies.=⇒ 3f ≤ 2e for any planar graph. Or f ≤ 2

18 / 20

=⇒ 3f ≤ 2e

for any planar graph. Or f ≤ 23e.

18 / 20

=⇒ 3f ≤ 2e for

any planar graph. Or f ≤ 23e.

18 / 20

=⇒ 3f ≤ 2e for any

planar graph. Or f ≤ 23e.

18 / 20

=⇒ 3f ≤ 2e for any planar

graph. Or f ≤ 23e.

18 / 20

=⇒ 3f ≤ 2e for any planar graph.

Or f ≤ 23e.

18 / 20

Plug into Euler:

v + 23e ≥ e+2 =⇒ e ≤ 3v −6

18 / 20

Plug into Euler: v + 23e ≥ e+2

=⇒ e ≤ 3v −6

18 / 20

Edges? 4+3+2+1 = 10. Vertices? 5.10 6≤ 3(5)−6 = 9. =⇒ K5 is not planar.

18 / 20

K5 Edges?

4+3+2+1 = 10. Vertices? 5.10 6≤ 3(5)−6 = 9. =⇒ K5 is not planar.

18 / 20

K5 Edges? 4+3+2+1

= 10. Vertices? 5.10 6≤ 3(5)−6 = 9. =⇒ K5 is not planar.

18 / 20

K5 Edges? 4+3+2+1 = 10.

Vertices? 5.10 6≤ 3(5)−6 = 9. =⇒ K5 is not planar.

18 / 20

K5 Edges? 4+3+2+1 = 10. Vertices?

5.10 6≤ 3(5)−6 = 9. =⇒ K5 is not planar.

18 / 20

K5 Edges? 4+3+2+1 = 10. Vertices? 5.

10 6≤ 3(5)−6 = 9. =⇒ K5 is not planar.

18 / 20

K5 Edges? 4+3+2+1 = 10. Vertices? 5.10 6≤ 3(5)−6 = 9.

=⇒ K5 is not planar.

18 / 20

Proving non-planarity for K3,3

Euler’s formula =⇒ 3f ≤ 2e

for any planar graph.

K3,3? Edges? 9. Vertices. 6.

9≤ 3(6)−6? Sure!

Proof doesn’t work. Let’s fix this.

But no cycles that are triangles. Face is of length ≥ 4.

Because all cycles are even length; bipartite or edges only gobetween two groups.

.... 4f ≤ 2e for any bipartite planar graph.Euler: v + 1

2e ≥ e+2 =⇒ e ≤ 2v −4 for bipartite planar graph

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

Euler’s formula =⇒ 3f ≤ 2e for any planar graph.

9≤ 3(6)−6? Sure!

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

Edges? 9. Vertices. 6.

9≤ 3(6)−6? Sure!

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

K3,3? Edges?

9. Vertices. 6.

9≤ 3(6)−6? Sure!

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

K3,3? Edges? 9.

Vertices. 6.

9≤ 3(6)−6? Sure!

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

9≤ 3(6)−6? Sure!

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

9≤ 3(6)−6?

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

9≤ 3(6)−6? Sure!

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

9≤ 3(6)−6? Sure!

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

9≤ 3(6)−6? Sure!

Proof doesn’t work.

Let’s fix this.

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

9≤ 3(6)−6? Sure!

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

9≤ 3(6)−6? Sure!

But no cycles that are triangles.

Face is of length ≥ 4.

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

9≤ 3(6)−6? Sure!

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

9≤ 3(6)−6? Sure!

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

9≤ 3(6)−6? Sure!

Because all cycles are even length;

bipartite or edges only gobetween two groups.

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

9≤ 3(6)−6? Sure!

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

9≤ 3(6)−6? Sure!

.... 4f ≤ 2e

for any bipartite planar graph.Euler: v + 1

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

9≤ 3(6)−6? Sure!

.... 4f ≤ 2e for

any bipartite planar graph.Euler: v + 1

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

9≤ 3(6)−6? Sure!

.... 4f ≤ 2e for any

bipartite planar graph.Euler: v + 1

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

9≤ 3(6)−6? Sure!

.... 4f ≤ 2e for any bipartite

planar graph.Euler: v + 1

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

9≤ 3(6)−6? Sure!

.... 4f ≤ 2e for any bipartite planar graph.

Euler: v + 12e ≥ e+2 =⇒ e ≤ 2v −4 for bipartite planar graph

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

9≤ 3(6)−6? Sure!

2e ≥ e+2

=⇒ e ≤ 2v −4 for bipartite planar graph

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

9≤ 3(6)−6? Sure!

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

9≤ 3(6)−6? Sure!

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

9≤ 3(6)−6? Sure!

9 6≤ 2(6)−4.

=⇒ K3,3 is not planar!

19 / 20

9≤ 3(6)−6? Sure!

9 6≤ 2(6)−4. =⇒ K3,3 is not planar!

19 / 20

Oh my goodness..what have we done!

Graphs.

Basics.Connectivity.Algorithm for Eulerian Tour.

Planar Graphs.

Euler’s formula.

Non-planarity of K5 and K3,3.

Next Time: prove Euler’s formula.

20 / 20

Graphs.Basics.

Connectivity.Algorithm for Eulerian Tour.

Planar Graphs.

Euler’s formula.

20 / 20

Graphs.Basics.

Connectivity.

Algorithm for Eulerian Tour.

Planar Graphs.

Euler’s formula.

20 / 20

Graphs.Basics.

Planar Graphs.

Euler’s formula.

20 / 20

Graphs.Basics.

Planar Graphs.

Euler’s formula.

20 / 20

Graphs.Basics.

Planar Graphs.

Euler’s formula.

20 / 20

Graphs.Basics.

Planar Graphs.

Euler’s formula.

20 / 20

Graphs.Basics.

Planar Graphs.

Euler’s formula.

20 / 20

Graphs.Basics.

Planar Graphs.

Euler’s formula.

20 / 20

· quick proof. the sum of the vertex degrees is equal to (a) the total number of vertices, jvj....

Documents

bermuda triangle ppt bestbermuda triangle ppt bestbermuda...

case 1:16-cv-00260-jej document 1 filed 02/12/16 page 1 of...

case 1:16-cv-00260-jej document 1 filed 02/12/16 page 1 of...

acquaintance time of a graphgiladt/ac.pdf · acquaintance...

etnický obraz košíc v slovenskej historiografii od jej

picture - am krakow 77 · - u niej nie hylo podzialu:...

discrete wiskunde ii, 2009 lecture 5: shortest paths...

csi 445/660 part 6 (centrality measures for...

wake 05 (sillage): jvj (2002)

zap them all!!! a presentation of zap - bug hell by...

cyberprzemoc i strategie jej przeciwdziaŁania

wanted comics 11 -jvj

bioremediacja gleb z ropy i jej produktów

holt ca course 1 8-4 triangles vocabulary triangle sum...

triangle summerblue. triangle winterred triangle...

bermuda triangle/devil's triangle

case 1:17-cv-00129-jej document 1-1 filed...

rr spring summer fall winter i 10na ua iic3 ion iq f app...

e„wó`» jvj - boierdokan -...

sztuczna inteligencja i jej społeczno-kulturowe implikacje...