Chapter 6: Graphs
6.2 The Euler Characteristic
Draw A Graph!
Any connected graph you want, but dont
make it too simple or too crazy
complicated
Only rule: No edges can cross (unless
theres a vertex where theyre crossing)
OK:
Not OK:
Now Count on Your Gr
Silly Stories, Each with a Moral (from Chapter 1 of The Heart of Mathematics)
Story 1: Thats a Meanie Genie
Alley wishes to find the famous jewel called the Rama Nujan. An obnoxious genie named
Murray grants her wish by providing her with 9 identical-look
Exam 2 Study Sheet
Contemporary Math, Fall 2013
Things to Know
1. What are the natural numbers, integers, rational numbers, and real numbers? What are the
symbols for those sets?
2. What is a 1-to-1 correspondence? What is cardinality? How do you show two
Exam 1 Study Sheet
Contemporary Math, Fall 2013
1. Look over the silly stories from the rst several days of class. A question very similar to one of them
will appear on the test.
2. List the rst several (5-10) Fibonacci numbers.
3. If I tell you that F14
Chapter 6: Graphs
6.1 Euler Circuits
The Knigsberg Bridge Problem
Can you cross each bridge once and only
once, and return to your starting point?
Graphs: Dots and Connections
Dots are called vertices (one dot is one
vertex)
Connections are called edges
G
Exam 2 Study Sheet
Contemporary Math, Fall 2013
Things to Know
What are the natural numbers, integers, rational numbers, and real numbers?
What is a 1-to-1 correspondence? What is cardinality? How do you show two sets have the
same cardinality? How do y
Final Exam Study Sheet
Contemporary Math, Fall 2013
Information about the test
The test will be in our usual classroom.
Section 1 (10:40 class) will have their exam Wednesay, Dec. 11 9:45-11:45 a.m.
Section 2 (2:10 class) will have their exam Friday, De
Exam 3 Study Sheet
Contemporary Math, Fall 2013
Information about the test
The test will be in class on Wednesday December 4.
The test covers chapters 6 and 7.
You should bring a calculator to the test. It should be able to do natural logs (ln). Cell p
Chapter 6: Graphs
6.2 The Euler Characteristic
Draw A Graph!
Any connected graph you want, but dont
make it too simple or too crazy
complicated
Only rule: No edges can cross (unless
theres a vertex where theyre crossing)
OK:
Not OK:
Now Count on Your Grap