Happy Pi Day!!!! Come celebrate – Winston Room, 12 Friday.

Slides:

Advertisements

Similar presentations

Improper Integrals II. Improper Integrals II by Mika Seppälä Improper Integrals An integral is improper if either: the interval of integration is infinitely.

Advertisements

STRAIGHT LINE GRAPHS y = mx + c.

Certifying algorithms Algorithms and Networks. Certifying algorithms What is it? Examples: –Euler tour –Bipartite graphs –Flow –Planarity Certifying algorithms2.

Approximation Algorithms

AP Calculus Section 3.4 Concavity and the Second Derivative Test

Planar / Non-Planar Graphs Gabriel Laden CS146 – Spring 2004 Dr. Sin-Min Lee.

Planarity and Higher Order Embeddings Shawn Cox CS 594: Graph Theory

Parallel Line Proof. Parallel Line Proof The idea behind a proof is that you begin with information that is given to you as part of the problem and you.

1 Constructing Convex 3-Polytopes From Two Triangulations of a Polygon Benjamin Marlin Dept. of Mathematics & Statistics McGill University Godfried Toussaint.

Andrew's Monotone Chain Convex Hull Algorithm. Andrew's Monotone Chain Scan A left-to-right variant of Graham's scan Discovered by Andrew in 1979 Using.

Kerry R. Sipe Aug. 1, 2007 On the Non-Orientable Genus of Zero Divisor Graphs Missouri State University REU.

Week 11 – Cop number of outerplanar graphs Dr. Anthony Bonato Ryerson University AM8002 Fall 2014.

Applied Combinatorics, 4th Ed. Alan Tucker

What is the next line of the proof? a). Let G be a graph with k vertices. b). Assume the theorem holds for all graphs with k+1 vertices. c). Let G be a.

1 Internet Networking Spring 2004 Tutorial 9 Max-Min Fairness.

Can Dijkstra’s Algorithm be modified in an obvious way to give the longest path in a graph? a). Yes b). No c). I have absolutely no idea.

Is the following graph Hamiltonian- connected from vertex v? a). Yes b). No c). I have absolutely no idea v.

Is C 6 2-critical? a). Yes b). No c). I have absolutely no idea.

New Algorithm DOM for Graph Coloring by Domination Covering

Drawing of G. Planar Embedding of G Proposition Proof. 1. Consider a drawing of K 5 or K 3,3 in the plane. Let C be a spanning cycle. 2. If the.

A network is shown, with a flow f. v u 6,2 2,2 4,1 5,3 2,1 3,2 5,1 4,1 3,3 Is f a maximum flow? (a) Yes (b) No (c) I have absolutely no idea a b c d.

What is the next line of the proof? a). Assume the theorem holds for all graphs with k edges. b). Let G be a graph with k edges. c). Assume the theorem.

CS 2813 Discrete Structures

9.8 Graph Coloring. Coloring Goal: Pick as few colors as possible so that two adjacent regions never have the same color. See handout.

Applications of types of SATs Arash Ahadi What is SAT?

Linearity and Local Linearity. Linear Functions.

Jokes and Riddles to celebrate Π

4.4 The Fundamental Theorem of Calculus

V Spanning Trees Spanning Trees v Minimum Spanning Trees Minimum Spanning Trees v Kruskal’s Algorithm v Example Example v Planar Graphs Planar Graphs v.

Although this may seem a paradox, all exact science is dominated by the idea of approximation. Bertrand Russell Approximation Algorithm.

SAT Prep. Continuity and One-Sided Limits Determine continuity at a point and an open interval Determine one-sided limits and continuity on a closed interval.

Lecture 14: Graph Theory I Discrete Mathematical Structures: Theory and Applications.

Planar Graphs Graph Coloring

Some NP-complete Problems in Graph Theory Prof. Sin-Min Lee.

Notes Over 2.8 Graphing an Absolute Value Function xy Vertex: Axis of Symmetry: Slope: ( 1, 2 ) x = 1 up 2, right/left.

2.7: Use Absolute Value Functions and Transformations HW Monday: p.127 (4-20 even) Test , 2.7: Friday.

Great Theoretical Ideas in Computer Science for Some.

5-color theorem 林典濤 : PPT, Lecture note 陳咨翰 : Presentation.

Algebra – 3.3 Distance and Absolute Value. DISTANCE What’s the distance between these points? (-1, -3) and (4, -3) (-1, -3) and (-1, 9) (2, 1) and (-3,

Planar Graphs (part 2) prepared and Instructed by Gideon Blocq Semester B, 2014 June 2014Planar Graphs (part 2)1.

Great Theoretical Ideas In Computer Science

Discrete Mathematics Graph: Planar Graph Yuan Luo

Characteristics of Planar Graphs

4.4 The Fundamental Theorem of Calculus

Andrew's Monotone Chain Convex Hull Algorithm

Applied Combinatorics, 4th Ed. Alan Tucker

What is the next line of the proof?

Here is the graph of a function

Graph Theory Graph Colorings.

Local Linearity.

Lecture 11 Overview Self-Reducibility.

Local Linearity.

Here are four triangles. What do all of these triangles have in common

Applied Combinatorics, 4th Ed. Alan Tucker

Graphing Absolute Value Functions

Y The graph of a rule connecting x and y is shown. From the graph, when x is -1, what is y? Give me a value of x that makes y positive, negative, equal.

Local Linearity.

MAT 2720 Discrete Mathematics

Around the room Orders of operations.

Jeopardy Final Jeopardy Solving Equations Solving Inequalities

Using “T” Tables & Graphing Intercepts

Parallel Line Proof.

Drawing a graph

Presentation transcript:

Happy Pi Day!!!! Come celebrate – Winston Room, 12 Friday

What is the crossing number of K 5 ? a). 0 b). 1 c). 2 d). 3 e). 4 f). 5 g). 6 h). 7 i). I have absolutely no idea but it is definitely bigger than any of these options!

What is the crossing number of the graph shown? a). 0 b). 1 c). 2 d). 3 e). 4 f). 5 g). 6 h). 7 i). I have absolutely no idea but it is definitely bigger than any of these options!

What is the crossing number of the graph shown? a). 0 b). 1 c). 2 d). 3 e). 4 f). 5 g). 6 h). 7 i). I have absolutely no idea but it is definitely bigger than any of these options!

What is the crossing number of K 10 ? a). 0 b). 1 c). 2 d). 3 e). 4 f). 5 g). 6 h). 7 i). I have absolutely no idea but it is definitely bigger than any of these options!

Final Project Ideas: 1.Proof of Kuratowski’s Theorem 2. Study Maximal Planar Graphs 3. Learn algorithm for determining planarity (1964, P) 4. Theorem: If planar, then planar with all straight lines 5. Crossing number (Many options here) 6. Genus

What is the coloring number of K 5 ? a). 0 b). 1 c). 2 d). 3 e). 4 f). 5 g). 6 h). 7 i). I have absolutely no idea but it is definitely bigger than any of these options!

What is the coloring number of K 6, 10 ? a). 0 b). 1 c). 2 d). 3 e). 4 f). 5 g). 6 h). 7 i). I have absolutely no idea but it is definitely bigger than any of these options!

What is the coloring number of C 7 ? a). 0 b). 1 c). 2 d). 3 e). 4 f). 5 g). 6 h). 7 i). I have absolutely no idea but it is definitely bigger than any of these options!

What is the coloring number of the graph shown? a). 0 b). 1 c). 2 d). 3 e). 4 f). 5 g). 6 h). 7 i). I have absolutely no idea but it is definitely bigger than any of these options!