21
. . MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read 5.1 Exam 3 is Friday, March 9th, during class. Today we will introduce some graphs and Euler circuits.

MA111: Contemporary mathematicsjack/2012-01-MA111/2012-02-20-MA111-Slides.pdf · MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read

  • Upload
    others

  • View
    8

  • Download
    0

Embed Size (px)

Citation preview

Page 1: MA111: Contemporary mathematicsjack/2012-01-MA111/2012-02-20-MA111-Slides.pdf · MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read

.

......MA111: Contemporary mathematics

Jack Schmidt

University of Kentucky

February 20, 2012

Schedule:

Read 5.1

Exam 3 is Friday, March 9th, during class.

Today we will introduce some graphs and Euler circuits.

Page 2: MA111: Contemporary mathematicsjack/2012-01-MA111/2012-02-20-MA111-Slides.pdf · MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read

Each pair of friends has exactly one other friend in common

5 people: Alex, Bart, Chad, Dave, Evan

Some are friends, some are not.

Alex has the most friends.

Bart and Chad are friends.

Dave and Evan are friends.

Every pair of friends has exactly one other friend in common

Can you draw a picture of who is friends with whom?

Page 3: MA111: Contemporary mathematicsjack/2012-01-MA111/2012-02-20-MA111-Slides.pdf · MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read

Chapter 5 overview

Graphs have vertices and edges between the vertices

Vertices can be virtually anything; a graph only knowswhich pairs are related and which are not

We’ll be looking at a chain of relations:

(A,B) → (B,C ) → (C ,D) → (D,A) → (A,C ) → (C ,E ) → . . .

If the chain includes all the relations(exactly once, and no non-relations),

then we call it an Euler path

Very easy way to tell if they exist

Reasonable ways to find them when they exist

Page 4: MA111: Contemporary mathematicsjack/2012-01-MA111/2012-02-20-MA111-Slides.pdf · MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read

5.1: Example problems

When I move to a new place, I need to walk through every doorway

It loses some newness if I go through a doorway more than once

Can I tour the doors of the house without repeats?

..

A

.

B

.

C

.

D

.

E

.

F

Page 5: MA111: Contemporary mathematicsjack/2012-01-MA111/2012-02-20-MA111-Slides.pdf · MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read

5.1: Example problems

I forgot the toilets and closets.

Can I tour the doors of the house without repeats now?

..

A

.

B

.

C

.

D

.

E

.

F

.

a

.

b

.

e

.

f

Page 6: MA111: Contemporary mathematicsjack/2012-01-MA111/2012-02-20-MA111-Slides.pdf · MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read

A Halloween Tradition

Every October, Plankton executes an evil plan.

He disguises himself as Mr. Blikand hides in your stuff!

He could be anywhere, even under your chair!

The only way to get rid of it is to give it to someoneyou haven’t already given it to

If we only let the people in this room play,how many times can you get rid of the toy?

Can the toy get stuck before everyone has gotten ridof the toy?

Page 7: MA111: Contemporary mathematicsjack/2012-01-MA111/2012-02-20-MA111-Slides.pdf · MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read

A Halloween Tradition

Every October, Plankton executes an evil plan.

He disguises himself as Mr. Blikand hides in your stuff!

He could be anywhere, even under your chair!

The only way to get rid of it is to give it to someoneyou haven’t already given it to

If we only let the people in this room play,how many times can you get rid of the toy?

Can the toy get stuck before everyone has gotten ridof the toy?

Page 8: MA111: Contemporary mathematicsjack/2012-01-MA111/2012-02-20-MA111-Slides.pdf · MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read

A Halloween Tradition

Every October, Plankton executes an evil plan.

He disguises himself as Mr. Blikand hides in your stuff!

He could be anywhere, even under your chair!

The only way to get rid of it is to give it to someoneyou haven’t already given it to

If we only let the people in this room play,how many times can you get rid of the toy?

Can the toy get stuck before everyone has gotten ridof the toy?

Page 9: MA111: Contemporary mathematicsjack/2012-01-MA111/2012-02-20-MA111-Slides.pdf · MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read

A Halloween Tradition

Every October, Plankton executes an evil plan.

He disguises himself as Mr. Blikand hides in your stuff!

He could be anywhere, even under your chair!

The only way to get rid of it is to give it to someoneyou haven’t already given it to

If we only let the people in this room play,how many times can you get rid of the toy?

Can the toy get stuck before everyone has gotten ridof the toy?

Page 10: MA111: Contemporary mathematicsjack/2012-01-MA111/2012-02-20-MA111-Slides.pdf · MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read

A Halloween Tradition

Every October, Plankton executes an evil plan.

He disguises himself as Mr. Blikand hides in your stuff!

He could be anywhere, even under your chair!

The only way to get rid of it is to give it to someoneyou haven’t already given it to

If we only let the people in this room play,how many times can you get rid of the toy?

Can the toy get stuck before everyone has gotten ridof the toy?

Page 11: MA111: Contemporary mathematicsjack/2012-01-MA111/2012-02-20-MA111-Slides.pdf · MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read

A Halloween Tradition

Every October, Plankton executes an evil plan.

He disguises himself as Mr. Blikand hides in your stuff!

He could be anywhere, even under your chair!

The only way to get rid of it is to give it to someoneyou haven’t already given it to

If we only let the people in this room play,how many times can you get rid of the toy?

Can the toy get stuck before everyone has gotten ridof the toy?

Page 12: MA111: Contemporary mathematicsjack/2012-01-MA111/2012-02-20-MA111-Slides.pdf · MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read

On patrol again

Can the postal carrier walk every street exactly once

They should start and end at the Post Office

Page 13: MA111: Contemporary mathematicsjack/2012-01-MA111/2012-02-20-MA111-Slides.pdf · MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read

These are all the same question

Mathematics looks at many different problemsand finds the common structure

A strategy to win all similar games

The house has doors that connect rooms

The Mr. Blik game has exchanges between people

The postal carrier has roads between intersections

The generic has edges between verticeswe want to travel over all edges

Page 14: MA111: Contemporary mathematicsjack/2012-01-MA111/2012-02-20-MA111-Slides.pdf · MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read

The house as a graph

A simpler picture

..

A

. B.

C

. D.

E

. F..

A

.

B

.

C

.

D

.

E

.

F

The connections are the same in both pictures

Page 15: MA111: Contemporary mathematicsjack/2012-01-MA111/2012-02-20-MA111-Slides.pdf · MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read

The house with toilets as a graph

A simpler picture

..

a

.b.

A

. B.

C

. D.

E

. F.

e

. f..

A

.

B

.

C

.

D

.

E

.

F

.

a

.

b

.

e

.

f

The connections are the same in both pictures

Page 16: MA111: Contemporary mathematicsjack/2012-01-MA111/2012-02-20-MA111-Slides.pdf · MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read

The mean way to play the game

Everyone gives it to Jack, Jack gives it to each person

.....................................................................

Page 17: MA111: Contemporary mathematicsjack/2012-01-MA111/2012-02-20-MA111-Slides.pdf · MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read

Sharing is caring

What if you got points for how many times you got rid of the toy?

”Give it to Jack” is a terrible strategy, since it’ll get stuck(And Jack will get 70 points!)

Get in groups of 4 to 5 and figure out how to pass the toy for themaximum number of points

Be prepared to draw your solution at the board

Page 18: MA111: Contemporary mathematicsjack/2012-01-MA111/2012-02-20-MA111-Slides.pdf · MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read

The postal patrol

Here is the city as a graph

.............

P

.......................

Page 19: MA111: Contemporary mathematicsjack/2012-01-MA111/2012-02-20-MA111-Slides.pdf · MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read

You draw them

Draw a graph that can be traced

Draw a graph that obviously can’t be traced

Draw a graph that can’t be traced, but that might take a 5 yr olda little time to figure out

Be prepared to draw at the board!

Page 20: MA111: Contemporary mathematicsjack/2012-01-MA111/2012-02-20-MA111-Slides.pdf · MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read

Can these be traced?

............ A.

B

.

C

.D .

Y

.

V

.X

.W

.

E

.Z............ A.

B

.

C

.

D

.

E

.

Z

.

W

.

Y

.

V

.X

Page 21: MA111: Contemporary mathematicsjack/2012-01-MA111/2012-02-20-MA111-Slides.pdf · MA111: Contemporary mathematics Jack Schmidt University of Kentucky February 20, 2012 Schedule: Read

Can these be traced?

.. a0.

a1

.

a2

.a3 .

a4

.

a5

.. a0.

a1

.

a2

.a3 .

a4

.

a5