Beyond the Euler Trail. Mathematics is often thought of as formulas, ratios, and the number Pi. The history of

Similar documents
Circuits and Paths. April 13, 2014

Graph theory was invented by a mathematician named Euler in the 18th century. We will see some of the problems which motivated its study.

MATH 113 Section 9.2: Topology

Graph Theory. 26 March Graph Theory 26 March /29

Mohammad A. Yazdani, Ph.D. Abstract

GRAPH THEORY AND COMBINATORICS ( Common to CSE and ISE ) UNIT 1

Section 3.4 Basic Results of Graph Theory

Leonhard Euler His Life, The Man, and His Work

FINDING THE RIGHT PATH

CHAPTER 10 GRAPHS AND TREES. Alessandro Artale UniBZ - artale/z

Worksheet 28: Wednesday November 18 Euler and Topology

Sarah Will Math 490 December 2, 2009

Grade 7/8 Math Circles Graph Theory - Solutions October 13/14, 2015

Graph Theory

Networks and Graphs: Circuits, Paths, and Graph Structures VII.A Student Activity Sheet 1: Euler Circuits and Paths

Networks and Graphs: Circuits, Paths, and Graph Structures VII.A Student Activity Sheet 1: Euler Circuits and Paths

6.2. Paths and Cycles

08. First and second degree equations

Junior Circle Meeting 3 Circuits and Paths. April 18, 2010

Fundamental Properties of Graphs

Graph Theory. 1 Introduction to Graphs. Martin Stynes Department of Mathematics, UCC January 26, 2011

of Nebraska - Lincoln

Grades 7 & 8, Math Circles 31 October/1/2 November, Graph Theory

Graph Theory Problems Instructor: Natalya St. Clair. 1 The Seven Bridges of Königsberg Problem

Chapter 5: The Mathematics of Getting Around

Math 776 Graph Theory Lecture Note 1 Basic concepts

Pick s Theorem! Finding the area of polygons on a square lattice grid.

Leonhard Euler: 300 years old

Intermediate Math Circles Wednesday, February 22, 2017 Graph Theory III

11-5 Networks. Königsberg Bridge Problem

The Picture of Dorian Gray

Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around

Discrete Mathematics for CS Spring 2008 David Wagner Note 13. An Introduction to Graphs

Launch problem: Lining streets

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8

AQR UNIT 7. Circuits, Paths, and Graph Structures. Packet #

TWO CONTRIBUTIONS OF EULER

Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around

Notebook Assignments

Math 110 Graph Theory II: Circuits and Paths

Walking with Euler through Ostpreußen and RNA

GRAPH THEORY AND LOGISTICS

The Human Brain & Graph Theory

Introduction to Networks

Chapter 11: Graphs and Trees. March 23, 2008

1. The Highway Inspector s Problem

Born in Tulsa in 1914 and passed away in Norman in 2010.

The premature state of Topology and Graph Theory nourished by Seven Bridges of Königsberg Problem

#30: Graph theory May 25, 2009

Introduction to Engineering Systems, ESD.00. Networks. Lecturers: Professor Joseph Sussman Dr. Afreen Siddiqi TA: Regina Clewlow

Vertex-Edge Graphs. Vertex-Edge Graphs In the Georgia Performance Standards. Sarah Holliday Southern Polytechnic State University

Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 7

Crossing bridges. Crossing bridges Great Ideas in Theoretical Computer Science. Lecture 12: Graphs I: The Basics. Königsberg (Prussia)

Brief History. Graph Theory. What is a graph? Types of graphs Directed graph: a graph that has edges with specific directions

The ancient Egyptians used a decimal system in which pictographs were used to represent powers of 10.

Today s Outline. CSE 326: Data Structures. Topic #15: Cool Graphs n Pretty Pictures. A Great Mathematician. The Bridges of Königsberg

An Introduction to Graph Theory

The Bridges of Konigsberg Problem Can you walk around the town crossing each bridge only once?

Topic 10 Part 2 [474 marks]

Basic Combinatorics. Math 40210, Section 01 Fall Homework 4 Solutions

Graph Theory. Part of Texas Counties.

Section Graphs, Paths, and Circuits. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

The Konigsberg Bridge Problem

(Refer Slide Time: 06:01)

Graph Theory CS/Math231 Discrete Mathematics Spring2015

Dissertation Title. Royal Holloway logo guidelines. Dissertation Subtitle. Stephen D. Wolthusen

Questions? You are given the complete graph of Facebook. What questions would you ask? (What questions could we hope to answer?)

PATH FINDING AND GRAPH TRAVERSAL

Two vertices that are joined by an edge are said to be adjacent. They are also called neighbours.

Discrete mathematics

Grade 7/8 Math Circles November 3/4, M.C. Escher and Tessellations

The Untold Story of. Debugiano. By Bill Gowans

MERCY BY DENEANE CLARK DOWNLOAD EBOOK : MERCY BY DENEANE CLARK PDF

Salvador Sanabria History of Mathematics. Königsberg Bridge Problem

Section Graphs, Paths, and Circuits. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Displaying Data with Graphs. Chapter 6 Mathematics of Data Management (Nelson) MDM 4U

Characterization of Graphs with Eulerian Circuits

Graph Theory and its Applications

Math 778S Spectral Graph Theory Handout #2: Basic graph theory

V1.0: Seth Gilbert, V1.1: Steven Halim August 30, Abstract. d(e), and we assume that the distance function is non-negative (i.e., d(x, y) 0).

INTRODUCTION TO GRAPH THEORY. 1. Definitions

Lecture 5: Graphs. Rajat Mittal. IIT Kanpur

Math 443/543 Graph Theory Notes 2: Transportation problems

14.2 Euler Paths and Circuits filled in.notebook November 18, Euler Paths and Euler Circuits

SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. An Introduction to Graph Theory

The Art Gallery Question

Math 100 Homework 4 B A C E

Early Writings on Graph Theory: Euler Circuits and The Königsberg Bridge Problem

AMICABLE PAIRS OF THE FORM (i, 1)

Introduction III. Graphs. Motivations I. Introduction IV

Graphs. Reading Assignment. Mandatory: Chapter 3 Sections 3.1 & 3.2. Peeking into Computer Science. Jalal Kawash 2010

Week 10: Colouring graphs, and Euler s paths. 14 and 16 November, 2018

ALGORITHMS FOR FINDING AN EULERIAN TRAIL

Sections 5.2, 5.3. & 5.4

Graph Theory. Chapter 4.

Math 311. Trees Name: A Candel CSUN Math

Multi-edges, loops, and two or more pieces are all allowed. Example 4 (Not Graphs). None of the following are graphs.

Ma/CS 6a Class 8: Eulerian Cycles

Lecture 1: An Introduction to Graph Theory

ASSIGNMENT 4 SOLUTIONS

Transcription:

Patino 1 Prof. Petersen Sierra Patino Math 101 Section 4939 6 April 2016 Beyond the Euler Trail Mathematics is often thought of as formulas, ratios, and the number Pi. The history of math and its roots tend to get ignored and left out when people learn the complex subject. Leonhard Euler was a renowned mathematician. On referring to Euler s work, Keith J. Devlin, a 20th century British mathematician once said, Like a Shakespearean sonnet that captures the very essence of love, or a painting that brings out the beauty of the human form that is far more than just skin deep, Euler's equation reaches down into the very depths of existence. Euler s life might not have been the most extravagant, yet his legacy led to a math concept that is used for modern life. Leonhard Euler was born on April 15 th, 1707 in Basel Switzerland, to his father Paul Euler and mother Marguerite Buck. Euler was raised in a very religious environment, with his father being a pastor, and his mother being the daughter of a pastor. Paul Euler was a friend of Johann Bernoulli, who himself, was a celebrated mathematician at the time. Bernoulli had a prominent influence on the Leonhard Euler, which drove him to his love of mathematics.

Patino 2 By the time Euler was a teenager, he had already attended the University of Basel and earned a masters degree. Before the age of twenty, Euler had served in the Navy and was already planning to move to Russia to join the St. Petersburg Academy. Euler had become a professor of physics and later was the head of the mathematics division. He was already well on his way to becoming a cherished mathematician. In 1734, Euler married Katharina Gsell, but just a year later Euler suffered from a fever that was so severe it almost caused him to become blind in one eye. Euler and his wife had thirteen children. Sadly, only five children survived beyond infancy. After being married thirtynine years, Katharina died. Euler later married Salome, Katharina s half sister, in 1776. In the mid-1740s, Euler became the appointed the mathematics director of the Berlin Academy of Science and Beaux Arts, which was a relatively new school. Euler took on several management positions and eventually became the head of the school in 1759. A year later Euler was given patronage by Catherin II and returned to St. Petersburg Academy. In the early 1770s, Euler had officially lost his sight, after he did not allow appropriate time to recover from an operation. Leonhard Euler eventually died while working in St. Petersburg on September 18, in 1783 from a brain hemorrhage. Euler s legacy will forever live on in the work he accomplished during his life, especially his work in graph theory, which is still used to this day. Leonhard Euler created graph theory in the 1730s when he speculated if it was possible to walk across each of the seven bridges of Königsberg, only once. It was not necessary to start and stop in the same place. For years, the Königsberg bridge problem was considered to be one of the toughest problems to solve. In 1736 Euler revealed the solution. Euler proved that it was impossible for one person to cross each bridge exactly once. To prove it, Euler drew a graph that

Patino 3 consisted of vertices, (points that are linked by edges) and edges, (lines that connect vertices). When Euler set out to solve the problem, he started by drawing a graph and eliminating all of the unnecessary details like buildings and rivers. Euler made each vertex a place, each edge a bridge (see figure above with points A-D). He gave each vertex a number to represent how many edges connected to it. This is called a degree. Points A, C, and D all have three degrees each, and point B had a total of five degrees. In order for the graph to be traversable, the graph has to either be an Euler trail, which can only have two or less odd degrees of vertices, or the graph is an Euler circuit, which must have all even degrees of vertices. The graph that is drawn for the Königsberg bridge problem is made up all odd vertices making it not traversable. This solution launched graph theory into mathematics forever. Within graph theory are several types of graphs. An Euler circuit, which I mentioned before, is where the edges can only be traversed once. Vertices may be crossed more than once, and both the end point and the start point are the same. An Euler path is very similar to an Euler circuit, the difference is, the start point and the end point does not have to be the same point. Similarly to Euler circuits, Hamilton circuits start and end at the same point, yet instead of crossing each edge, Hamilton circuits try to

Patino 4 touch every vertex. Hamilton paths do the same, but their start and end points don t have to be the same. Graph theory is a very important concept that is still applicable today. It is used in transportation, biology, computer sciences, engineering, security network, and social networking. To show how graph theory is applied to social websites I decided to apply it to my Facebook friends. First I had to decide what it was I am trying to discover with my graph. I opted for the degree of centrality, which measures ones social influence. The more friends that a person had, represents how great of a social influence the person has. If I am a person of great influence then my graph, will look like this: If I am a person of low influence, but high connectivity my end graph will look like this:

Patino 5 I created my definitions and rules. Each vertex would represent a friend and each edge would be our friend ship. I also decided that I would base this off of six close friends and would spread out to three mutual friends at the most. To help keep my friends private I decided to go by their first name s initial only. Now it s time draw out my map. I started by picking the six friends I would use. I chose friend from different groups and aspects of my life. Then I compared three of their mutual friends too see if there were any connections. Once I had all of my information, I mapped out all of my connections, and this was my final result:

Patino 6 My final result is very similar to what I pictured it would be. While I picked friends that I thought were from different aspects of my life, I knew a lot of my friends shared common interests. I might not be a person of great influence, but I do have high connectivity. Leonhard Euler started his love for math at a young age, when Paul Euler, and Johann Bernoulli taught him the basics. As his love for math grew, so did his family, career and legacy. Euler s life came to a sad end, but he left the world with a new concept that is used even to this day. Many may go their whole lives with out even wondering who it was created the math concepts, but there are those that will keep mathematicians like Euler, from disappearing completely.

Patino 7 Works cited Baker, Greg. "Euler and Hamiltonian Paths." 2013. Web. 3 Apr. 2016. "Leonhard Euler Biography." Bio.com. A&E Networks Television. Web. 03 Apr. 2016. Edwins, Laura. "Leonhard Euler, His Famous Formula, and Why He's so Revered ( Video)." The Christian Science Monitor. The Christian Science Monitor, 2013. Web. 01 Apr. 2016. "Euler - 18th Century Mathematics - The Story of Mathematics." Euler - 18th Century Mathematics - The Story of Mathematics. Web. 02 Apr. 2016. "Gliffy Editor - Online." Gliffy. Web. 03 Apr. 2016. "Graph Theory: Part III (Facebook)." Graph Theory: Part III (Facebook). Web. 03 Apr. 2016. "Graph Theory World of Mathematics." World of Mathematics. Web. 01 Apr. 2016.