1 Plane and Planar Graphs. Definition 1 A graph G(V,E) is called plane if


 Gordon Sims
 1 years ago
 Views:
Transcription
1 Plane and Planar Graphs Definition A graph G(V,E) is called plane if V is a set of points in the plane; E is a set of curves in the plane such that. every curve contains at most two vertices and these vertices are the ends of the curve;. the intersection of every two curves is either empty, or one, or two vertices of the graph. Definition A graph is called planar, if it is isomorphic to a plane graph. The plane graph which is isomorphic to a given planar graph G is said to be embedded in the plane. A plane graph isomorphic to G is called its drawing G is a planar graph H is a plane graph isomorphic to G
2 The adjacency list of graph F. Is it planar? What happens if we add edge (,)? Or edge (7,4)?
3 Definition A set U in a plane is called open, if for every U, all points within some distance r from belong to U. A region is an open set U which contains polygonal u,vcurve for every two points u,v U. area without the boundary Definition 4 Given a plane graph G(V,E), a face of G is a maimal region of the plane if the vertices and the edges of G are removed. An unbounded (infinite) face of G is called eterior, or outer face. The vertices and the edges of G that are incident with a face F form the boundary of F.
4 Proposition For every face of a given plane graph G, there is a drawing of G for which the face is eterior
5 Dual Plane Graphs Definition 5 Let G be a plane graph. The dual graph G of G is a new plane graph having a verte for each face in G and the edges that correspond to the edges of G in the following manner: if e is an edge of G which separates two faces X and Y, then the corresponding dual edge e E(G ) is an edge joining the vertices and y that correspond to X and Y respectively. Remark. Different plane drawings (embeddings) of the same planar graph may have nonisomorphic duals. Construct duals to these drawings. 5
6 Definition 6 The length of a face F in a plane graph G is the total number of edges in the closed walks in G that bound the face. Proposition If l(f i ) denotes the length (the number of edges in its boundary), of face F i in a plane graph G, then Definition 7 e(g) = l(f i ). A bond of a graph G is a minimal nonempty edge cut. Proposition Edges of a plane graph G form a cycle iff the corresponding edges in G form a bond. 6
7 Theorem (Euler): If G is a connected plane (p,q)graph with r faces, then p q +r =. Proof. We prove it by induction on q. Base. If q = 0, then p = ; obviously, r =, and the result follows. Inductive Step. Assume that the Euler Theorem holds true for all connected graphs with fewer than q (q ) edges, and let G be a connected plane graph with q edges. If G is a tree, then p = q+ and r = (the only face is eterior) implying the result. If G is not a tree, then it has an enclosed face. The edges of the face form a cycle. Take any edge e on the cycle and consider graph H = G e. Since q(h) = q, by induction, p(h) q(h)+r(h) =. But p(h) = p and r(h) = r. The result follows. 7
8 Theorem If G is a planar graph (no parallel edges) with p vertices and q edges, (q ), then q p 6. If, in addition, G is bipartite, then q p 4. Proof. Let r be the number of faces of G and let m i be the number of edges in the boundary of the i th face (i =,...,r). Since every face contains at least three edges, r r i= m i. On the other hand, since every edge can be in the boundary of at most two faces, r m i q. i= Thus, r q and by Euler s Theorem, p q+q/, implying q p 6. If G is bipartite, the shortest cycle is of length at least 4. Thus, 4r r i= m i. Together with r i= m i q and p q+r =, we get the second part of the Theorem. 8
9 Corollary Every planar graph G contains a verte of degree at most 5. Proof. (HINT: assuming that all degrees are 6, estimate the number of edges in the graph, and compare your estimate with that by Theorem.) Corollary Graphs K, and K 5 are not planar. Proof. For K 5, p = 5 and q = 0. Thus, q > p 6 = 9 and by Theorem, K 5 is not planar. If K, were planar, then the second part of Theorem would apply, leading to a contradiction, since for this graph p = 6, q = 9, and q > p 4. Definition 8 A subdivision of an edge ab in a graph G is an operation which replaces ab with two edges az and zb where z is a new verte different from other vertices of G. The result of the subdivision is also called a subdivision of G. A Kuratowski graph is a graph obtained by several subdivisions from either K 5 or K,. Corollary No Kuratowski graph is planar. 9
10 Coloring Planar Graphs Theorem Every planar graph G is 5colorable. Proof. By induction on the number n(g) of vertices. Base. For all planar graphs with n(g) 5, the statement is correct. Inductive step. Let G have more than 5 vertices. Select a verte v of degree 5. It always eists, since else, the number of edges in the graph would eceed the upper bound of p 6. By induction, graph G v is 5colorable. Consider a 5coloring of G v. If any color,,, 4, 5 is 0
11 not used for vertices adjacent to v, use it for v. Thus, we need to assume that v has 5 neighbors that are colored using all 5 colors. Let us call those neighbors according to their colors: v,v,v,v 4,v 5 (see Figure below). Consider a bipartite graph H induced by all vertices of G v whose colors are or, and let C be the connected component of H which contains verte v. If C does not contain verte v, then we recolor C: every verte of C whose color is (resp. ) gets color (resp. ). This recoloring frees color for v, yielding a 5coloring of G. v 5 v 4 v v v v Finally, assume that C contains verte v. Thus, there is a  colored path connecting vertices and. This path together with verte v forms a cycle which makes it impossible the eistence of a path colored and 4 connecting vertices v and v 4. Thus, recoloring the colored connected component containing verte v makes color available for coloring v. 4 4
12 From colorings faces of a map to coloring its edges. The coloring of the faces of an arbitrary map is reduced to that of a map for which every verte has three incident edges. See the Figure below. An edge coloring of a graph G is an assignment of colors to edges such that any two edges incident to the same verte have different colors.
13 Theorem. (Tait, 878). A regular plane graph without bridges is 4face colorable iff it is edgecolorable. Proof. Suppose G satisfies the conditions of the theorem and it is 4facecolorable. Let the colors be c 0 = 00, c = 0, c = 0, c =. Because G is bridgeless, every edge bounds two distinct faces. Given an edge between faces colored c i and c j, assign this edge the color obtained by adding c i and c j coordinatewise modulo. For eample: c 0 +c = c ; c +c = c ; c +c = c The reverse. Suppose now that G has a proper edgecoloring, and let the colors be,, and. Since G is regular, every color appears at every verte. Let E,E, and E be the edgesets colored,, and, respectively. The union of any two of them is the union of disjoint cycles. Let H = E E and H = E E. The faces of graph H can be colored with two colors α and β. The faces of graph H can be colored with two colors γ and δ. Then each face of G is a subset of a face in H and a subset of a face in H. Assign to each face in G a pair of colors (,y) where
14 {α,β} and y {γ,δ}. It is easy to prove that any two adjacent faces of G get pairs off colors that are differ in at least one coordinate. Thus the assignment is a 4coloring of the faces of G. Tutte s conjecture: every bridgeless regular graph G which is not threeedge colorable has the Petersen graph as its minor, that is the Petersen graph can be obtained from G by contracting and removing edges. 4
15 Kuratowski theorem Definition 9 A subgraph H of a graph G which is a subdivision of K 5 or K, is called a Kuratowski graph. Theorem 4 Every nonplanar graph contains a Kuratowski subgraph. The Idea of a Proof. If the theorem is incorrect, let us take a smallest graph for which it fails. Thus, G is the smallest nonplanar graph without Kuratowski subgraphs. If e = y is an edge in G, then we form a new graph H by contracting e into a verte z, which is adjacent to all vertices that were adjacent to at least of one of and y. It turns out that such an operation does not create Kuratowski subgraphs (must be proved), thus by minimality of G, graph H is planar. Let us assume (must be checked if this can always be done) that an embedding of H z contains a face bounded by a cycle C, which contains all vertices adjacent to z. Then, the graph G has an almost plane embedding, where the only nonplane section is the edge e = y all of whose neighbors lie on cycle C =... t. Obviously, the way and y are adjacent to the vertices of C creates the nonplanarity of G. Analyzing the pattern of these adjacencies, we may find Kuratowski subgraphs in G. 5
16 4 Proof of Kuratowski s theorem Definition 0 A minimal nonplanar graph is a nonplanar graph F such that every proper subgraph of F is planar. Lemma For every face of a given plane graph G, there is a drawing of G for which the face is eterior. Lemma Every minimal nonplanar graph is connected. Proof. If G is disconnected, then by minimality, each component of G is planar, and the whole graph is planar, since we can embed every net component inside a face of the embedding of the previous component (under some ordering of the components). Let G have a cutverte and let G,G,...,G t be the connected components of G. Let H i be the subgraph induced on V(G i ) {}. By minimality of G, each H i is planar. Let us embed each H i so that verte is in the outer face and then squeeze H i into an angle < π/t at verte. Combining those embeddings together yields an embedding of G. G G H H H G 6
17 Definition Let S be a separating setof agraph G and G,...,G t be the connected components of G S. The lobes of S in G are subgraphs H,...,H t that are induced on V(G ) S,V(G ) S,...,V(G t ) S, respectively. Lemma Let S = {,y} be a separating set of G. If G is nonplanar, then at least for one lobe H i [S], adding edge y creates a nonplanar graph. Proof. Suppose for every lobe H i, graph H + i = H i y is planar (i =,...,t). Then, there is an embedding of H + i for which y is in the outer face. Then we create an embedding of G by attaching each net H + i+ to an embedding of i j=h + j, where H + i+ is embedded into the face that contains y. y 7
18 Lemma 4 Let G be a graph satisfying the following three conditions: ) G doesn t contain a Kuratowski subgraph; ) G is nonplanar; and ) among the graphs satisfying () and (), G has the smallest number of edges. Then G is connected. Proof. The condition () implies that the removal of any edge violates either () or (). Since it cannot create a Kuratowski subgraph, the removal of any edge creates a planar subgraph of G. Thus, G is a minimal nonplanar graph. By Lemma, G is at least connected. Suppose G is not  connected, and let S = {,y} be a separating set. Then by Lemma, adding edge y to some Slobe yields a nonplanar graph. Let H be that lobe and H + = H {y}. Since H + is nonplanar and has fewer edges than G does, H + must contain a Kuratowski subgraph, say K H +. Let H be an Slobe different from H. H + K C H + K P C y y y K P y Find a path P connecting and y in H. Now, we replace edge y in K with P. Clearly, K y P is a Kuratowski subgraph of G. The contradiction at least for one lobe H i [S], adding edge 8
19 y creates a nonplanar graph. implies that G has no cut, i.e. G is connected. Definition The operation of contraction of an edge e = (,y) of a graph G removes e, and y from the graph, and adds a new verte z, which is adjacent to any old verte u iff u was adjacent to at least one of or y. The resulting graph is denoted G/(,y). Lemma 5 Every connected graph G with at least five vertices has an edge e such that G/e is connected. Proof. Take any edgee = y and assume G/e isnot connected. Then G/e has aseparating set S of size. SinceGisconnected, S contains the verte replacing and y. Let z be the other verte. Then, {,y,z} is a separating set of G. C y D z u If G has no edge whose contraction yields a connected graph, every edge y has a verte z, call it a partner, such that the removal of,y and z disconnects the graph. Among all edges of G, we take edge y and a partner z whose removal from G creates the largest connected component C. Let D be the other component of G {,y,z}. 9
20 Since {,y,z} is a minimal separating set of G, each of the vertices,y,z has neighbors in C and in D. Let u D be a neighbor of z. and let v be the partner of edge zu. By definition, G {,y,z} is disconnected. If v is outside of set V(C) {,y}, then the removal of {z,u,v} creates a connected component which is larger than C, contradicting the choice of C. On the other hand, if v V(C) {,y}, then the removal of z, v disconnects G, contradicting the fact that G is connected. This completes the proof. C y z u v D C v y z u D 0
21 Lemma 6 If G/e has a Kuratowski subgraph, then G has Kuratowski subgraph. Proof. Let H be a Kuratowski subgraph of G/e, where e = y and let z be the verte of obtained from contracting y. If z V(H), H is a Kuratowski subgraph of G. If z V(H) is one of the vertices used to subdivide an edge in K 5, or K, to obtain H, then replacing z with, or y, or y yields a Kuratowski subgraph of G. If z V(H) and among the edges incident to z at most one is incident to (resp. y) (this must happen if H is a subdivision of K, ), then replacing z with y (resp. with ) reveals a Kuratowski subgraph in G. Finally, let H be a subdivision of K 5, and z be adjacent to four edges, two of which are adjacent to and the remaining two are adjacent to y. Let u and u (resp. v and v ) be the two vertices of degree 4 in H that are connected with z through the two edges incident to (resp. y). In this case, we find a subgraph of G which is a subdivided K, : vertices u,u, and y form one partition of the subgraph, and v,v, and form the other; the paths connecting them are those from H. z y u v u v u v u v
22 Theorem 5 Every graph without Kuratowski subgraph is planar. Proof. Because of lemma, we can consider connected graphs only. We prove the Theorem by induction on n the number of vertices of G. Base. If n 4, the the only connected graph is K 4, which is planar. Inductive Step. Let n 5 and e = y be an edge such that H = G/e is connected. planar cases K, K 5
When is a graph planar?
When is a graph planar? Theorem(Euler, 1758) If a plane multigraph G with k components has n vertices, e edges, and f faces, then n e + f = 1 + k. Corollary If G is a simple, planar graph with n(g) 3,
More informationIntroduction to Graph Theory
Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate
More informationLabeling outerplanar graphs with maximum degree three
Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics
More informationmost 4 Mirka Miller 1,2, Guillermo PinedaVillavicencio 3, The University of Newcastle Callaghan, NSW 2308, Australia University of West Bohemia
Complete catalogue of graphs of maimum degree 3 and defect at most 4 Mirka Miller 1,2, Guillermo PinedaVillavicencio 3, 1 School of Electrical Engineering and Computer Science The University of Newcastle
More informationDisjoint Compatible Geometric Matchings
Disjoint Compatible Geometric Matchings Mashhood Ishaque Diane L. Souvaine Csaba D. Tóth Abstract We prove that for every even set of n pairwise disjoint line segments in the plane in general position,
More informationRemoving Even Crossings
EuroComb 2005 DMTCS proc. AE, 2005, 105 110 Removing Even Crossings Michael J. Pelsmajer 1, Marcus Schaefer 2 and Daniel Štefankovič 2 1 Department of Applied Mathematics, Illinois Institute of Technology,
More informationDivideandConquer. Three main steps : 1. divide; 2. conquer; 3. merge.
DivideandConquer Three main steps : 1. divide; 2. conquer; 3. merge. 1 Let I denote the (sub)problem instance and S be its solution. The divideandconquer strategy can be described as follows. Procedure
More informationZachary Monaco Georgia College Olympic Coloring: Go For The Gold
Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various
More informationSHORT CYCLE COVERS OF GRAPHS WITH MINIMUM DEGREE THREE
SHOT YLE OVES OF PHS WITH MINIMUM DEEE THEE TOMÁŠ KISE, DNIEL KÁL, END LIDIKÝ, PVEL NEJEDLÝ OET ŠÁML, ND bstract. The Shortest ycle over onjecture of lon and Tarsi asserts that the edges of every bridgeless
More information3. Eulerian and Hamiltonian Graphs
3. Eulerian and Hamiltonian Graphs There are many games and puzzles which can be analysed by graph theoretic concepts. In fact, the two early discoveries which led to the existence of graphs arose from
More informationConnectivity and cuts
Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every
More informationMidterm Practice Problems
6.042/8.062J Mathematics for Computer Science October 2, 200 Tom Leighton, Marten van Dijk, and Brooke Cowan Midterm Practice Problems Problem. [0 points] In problem set you showed that the nand operator
More informationPOWER SETS AND RELATIONS
POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty
More informationSocial Media Mining. Graph Essentials
Graph Essentials Graph Basics Measures Graph and Essentials Metrics 2 2 Nodes and Edges A network is a graph nodes, actors, or vertices (plural of vertex) Connections, edges or ties Edge Node Measures
More information136 CHAPTER 4. INDUCTION, GRAPHS AND TREES
136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics
More informationOn parsimonious edgecolouring of graphs with maximum degree three
On parsimonious edgecolouring of graphs with maximum degree three JeanLuc Fouquet, JeanMarie Vanherpe To cite this version: JeanLuc Fouquet, JeanMarie Vanherpe. On parsimonious edgecolouring of graphs
More informationDiscrete Mathematics & Mathematical Reasoning Chapter 10: Graphs
Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph
More informationRemoving even crossings
Removing even crossings Michael J. Pelsmajer a, Marcus Schaefer b, Daniel Štefankovič c a Department of Applied Mathematics, Illinois Institute of Technology, Chicago, IL 60616, USA b Department of Computer
More informationCycles and cliqueminors in expanders
Cycles and cliqueminors in expanders Benny Sudakov UCLA and Princeton University Expanders Definition: The vertex boundary of a subset X of a graph G: X = { all vertices in G\X with at least one neighbor
More informationEvery tree contains a large induced subgraph with all degrees odd
Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University
More informationComputer Science Department. Technion  IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2connected graph G and any vertex s G there
 1  THREE TREEPATHS Avram Zehavi Alon Itai Computer Science Department Technion  IIT, Haifa, Israel Abstract Itai and Rodeh [IR] have proved that for any 2connected graph G and any vertex s G there
More informationMODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.
MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on
More informationA 2factor in which each cycle has long length in clawfree graphs
A factor in which each cycle has long length in clawfree graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science
More information8. Matchings and Factors
8. Matchings and Factors Consider the formation of an executive council by the parliament committee. Each committee needs to designate one of its members as an official representative to sit on the council,
More informationV. Adamchik 1. Graph Theory. Victor Adamchik. Fall of 2005
V. Adamchik 1 Graph Theory Victor Adamchik Fall of 2005 Plan 1. Basic Vocabulary 2. Regular graph 3. Connectivity 4. Representing Graphs Introduction A.Aho and J.Ulman acknowledge that Fundamentally, computer
More informationINCIDENCEBETWEENNESS GEOMETRY
INCIDENCEBETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More informationUPPER BOUNDS ON THE L(2, 1)LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE
UPPER BOUNDS ON THE L(2, 1)LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE ANDREW LUM ADVISOR: DAVID GUICHARD ABSTRACT. L(2,1)labeling was first defined by Jerrold Griggs [Gr, 1992] as a way to use graphs
More information3. Equivalence Relations. Discussion
3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,
More informationGraph Theory Lecture 3: Sum of Degrees Formulas, Planar Graphs, and Euler s Theorem Spring 2014 Morgan Schreffler Office: POT 902
Graph Theory Lecture 3: Sum of Degrees Formulas, Planar Graphs, and Euler s Theorem Spring 2014 Morgan Schreffler Office: POT 902 http://www.ms.uky.edu/~mschreffler Different Graphs, Similar Properties
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationCycles in a Graph Whose Lengths Differ by One or Two
Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDEBERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS
More informationIrreducible Divisor Graphs
Irreducible Divisor Graphs Jim Coykendall Department of Mathematics North Dakota State University Fargo, ND 581055075 Jack Maney Department of Mathematical Sciences The University of South Dakota 414
More informationHandout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs
MCS236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set
More informationGRAPH THEORY LECTURE 4: TREES
GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection
More informationThe chromatic spectrum of mixed hypergraphs
The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex
More informationCOMBINATORIAL PROPERTIES OF THE HIGMANSIMS GRAPH. 1. Introduction
COMBINATORIAL PROPERTIES OF THE HIGMANSIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the HigmanSims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact
More informationHomework Exam 1, Geometric Algorithms, 2016
Homework Exam 1, Geometric Algorithms, 2016 1. (3 points) Let P be a convex polyhedron in 3dimensional space. The boundary of P is represented as a DCEL, storing the incidence relationships between the
More informationOn the crossing number of K m,n
On the crossing number of K m,n Nagi H. Nahas nnahas@acm.org Submitted: Mar 15, 001; Accepted: Aug 10, 00; Published: Aug 1, 00 MR Subject Classifications: 05C10, 05C5 Abstract The best lower bound known
More informationSmall Maximal Independent Sets and Faster Exact Graph Coloring
Small Maximal Independent Sets and Faster Exact Graph Coloring David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science The Exact Graph Coloring Problem: Given an undirected
More informationHOLES 5.1. INTRODUCTION
HOLES 5.1. INTRODUCTION One of the major open problems in the field of art gallery theorems is to establish a theorem for polygons with holes. A polygon with holes is a polygon P enclosing several other
More informationA Turán Type Problem Concerning the Powers of the Degrees of a Graph
A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of HaifaORANIM, Tivon 36006, Israel. AMS Subject Classification:
More informationPART I. THE REAL NUMBERS
PART I. THE REAL NUMBERS This material assumes that you are already familiar with the real number system and the representation of the real numbers as points on the real line. I.1. THE NATURAL NUMBERS
More informationOdd induced subgraphs in graphs of maximum degree three
Odd induced subgraphs in graphs of maximum degree three David M. Berman, Hong Wang, and Larry Wargo Department of Mathematics University of New Orleans New Orleans, Louisiana, USA 70148 Abstract A longstanding
More informationMean RamseyTurán numbers
Mean RamseyTurán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρmean coloring of a graph is a coloring of the edges such that the average
More informationGraphs without proper subgraphs of minimum degree 3 and short cycles
Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract
More informationarxiv:1409.4299v1 [cs.cg] 15 Sep 2014
Planar Embeddings with Small and Uniform Faces Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl 3, and Ignaz Rutter 3,4 arxiv:409.499v [cs.cg] 5 Sep 04 Department of Engineering, Roma Tre University, Italy
More informationOutline 2.1 Graph Isomorphism 2.2 Automorphisms and Symmetry 2.3 Subgraphs, part 1
GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Abstract. Chapter focuses on the question of when two graphs are to be regarded as the same, on symmetries, and on subgraphs.. discusses the concept
More informationCS311H. Prof: Peter Stone. Department of Computer Science The University of Texas at Austin
CS311H Prof: Department of Computer Science The University of Texas at Austin Good Morning, Colleagues Good Morning, Colleagues Are there any questions? Logistics Class survey Logistics Class survey Homework
More informationSum of Degrees of Vertices Theorem
Sum of Degrees of Vertices Theorem Theorem (Sum of Degrees of Vertices Theorem) Suppose a graph has n vertices with degrees d 1, d 2, d 3,...,d n. Add together all degrees to get a new number d 1 + d 2
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by MenGen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationSOLUTIONS TO ASSIGNMENT 1 MATH 576
SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts
More informationMDegrees of QuadrangleFree Planar Graphs
MDegrees of QuadrangleFree Planar Graphs Oleg V. Borodin, 1 Alexandr V. Kostochka, 1,2 Naeem N. Sheikh, 2 and Gexin Yu 3 1 SOBOLEV INSTITUTE OF MATHEMATICS NOVOSIBIRSK 630090, RUSSIA Email: brdnoleg@math.nsc.ru
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationOn the independence number of graphs with maximum degree 3
On the independence number of graphs with maximum degree 3 Iyad A. Kanj Fenghui Zhang Abstract Let G be an undirected graph with maximum degree at most 3 such that G does not contain any of the three graphs
More informationFoundations of Geometry 1: Points, Lines, Segments, Angles
Chapter 3 Foundations of Geometry 1: Points, Lines, Segments, Angles 3.1 An Introduction to Proof Syllogism: The abstract form is: 1. All A is B. 2. X is A 3. X is B Example: Let s think about an example.
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationTHE ROOMMATES PROBLEM DISCUSSED
THE ROOMMATES PROBLEM DISCUSSED NATHAN SCHULZ Abstract. The stable roommates problem as originally posed by Gale and Shapley [1] in 1962 involves a single set of even cardinality 2n, each member of which
More informationOn planar regular graphs degree three without Hamiltonian cycles 1
On planar regular graphs degree three without Hamiltonian cycles 1 E. Grinbergs Computing Centre of Latvian State University Abstract. Necessary condition to have Hamiltonian cycle in planar graph is given.
More informationDivisor graphs have arbitrary order and size
Divisor graphs have arbitrary order and size arxiv:math/0606483v1 [math.co] 20 Jun 2006 Le Anh Vinh School of Mathematics University of New South Wales Sydney 2052 Australia Abstract A divisor graph G
More information2.3 Scheduling jobs on identical parallel machines
2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed
More informationPh.D. Thesis. Judit NagyGyörgy. Supervisor: Péter Hajnal Associate Professor
Online algorithms for combinatorial problems Ph.D. Thesis by Judit NagyGyörgy Supervisor: Péter Hajnal Associate Professor Doctoral School in Mathematics and Computer Science University of Szeged Bolyai
More informationDiscrete Mathematics Problems
Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 Email: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the
More informationShortcut sets for plane Euclidean networks (Extended abstract) 1
Shortcut sets for plane Euclidean networks (Extended abstract) 1 J. Cáceres a D. Garijo b A. González b A. Márquez b M. L. Puertas a P. Ribeiro c a Departamento de Matemáticas, Universidad de Almería,
More informationA Study of Sufficient Conditions for Hamiltonian Cycles
DeLeon 1 A Study of Sufficient Conditions for Hamiltonian Cycles Melissa DeLeon Department of Mathematics and Computer Science Seton Hall University South Orange, New Jersey 07079, U.S.A. ABSTRACT A graph
More informationIntroduction to Topology
Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................
More informationLarge induced subgraphs with all degrees odd
Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order
More informationMath 2443, Section 16.3
Math 44, Section 6. Review These notes will supplement not replace) the lectures based on Section 6. Section 6. i) ouble integrals over general regions: We defined double integrals over rectangles in the
More informationIMO Training 2010 Russianstyle Problems Alexander Remorov
Solutions: Combinatorial Geometry 1. No. Call a lattice point even if the sum of its coordinates is even, and call it odd otherwise. Call one of the legs first, and other one second. Then every time a
More informationSolutions to Homework 10
Solutions to Homework 1 Section 7., exercise # 1 (b,d): (b) Compute the value of R f dv, where f(x, y) = y/x and R = [1, 3] [, 4]. Solution: Since f is continuous over R, f is integrable over R. Let x
More informationArrangements And Duality
Arrangements And Duality 3.1 Introduction 3 Point configurations are tbe most basic structure we study in computational geometry. But what about configurations of more complicated shapes? For example,
More informationSimple Graphs Degrees, Isomorphism, Paths
Mathematics for Computer Science MIT 6.042J/18.062J Simple Graphs Degrees, Isomorphism, Types of Graphs Simple Graph this week MultiGraph Directed Graph next week Albert R Meyer, March 10, 2010 lec 6W.1
More informationTree sums and maximal connected Ispaces
Tree sums and maximal connected Ispaces Adam Bartoš drekin@gmail.com Faculty of Mathematics and Physics Charles University in Prague Twelfth Symposium on General Topology Prague, July 2016 Maximal and
More informationMinimum Makespan Scheduling
Minimum Makespan Scheduling Minimum makespan scheduling: Definition and variants Factor 2 algorithm for identical machines PTAS for identical machines Factor 2 algorithm for unrelated machines Martin Zachariasen,
More informationOn end degrees and infinite cycles in locally finite graphs
On end degrees and infinite cycles in locally finite graphs Henning Bruhn Maya Stein Abstract We introduce a natural extension of the vertex degree to ends. For the cycle space C(G) as proposed by Diestel
More informationNonSeparable Detachments of Graphs
Egerváry Research Group on Combinatorial Optimization Technical reports TR200112. Published by the Egrerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.
More informationZERODIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS
ZERODIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS M. AXTELL, J. COYKENDALL, AND J. STICKLES Abstract. We recall several results of zero divisor graphs of commutative rings. We
More informationLecture 17 : Equivalence and Order Relations DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion
More informationA NOTE ON EDGE GUARDS IN ART GALLERIES
A NOTE ON EDGE GUARDS IN ART GALLERIES R. Nandakumar (nandacumar@gmail.com) Abstract: We study the Art Gallery Problem with Edge Guards. We give an algorithm to arrange edge guards to guard only the inward
More informationTreerepresentation of set families and applications to combinatorial decompositions
Treerepresentation of set families and applications to combinatorial decompositions BinhMinh BuiXuan a, Michel Habib b Michaël Rao c a Department of Informatics, University of Bergen, Norway. buixuan@ii.uib.no
More informationPROBLEM SET 7: PIGEON HOLE PRINCIPLE
PROBLEM SET 7: PIGEON HOLE PRINCIPLE The pigeonhole principle is the following observation: Theorem. Suppose that > kn marbles are distributed over n jars, then one jar will contain at least k + marbles.
More informationCS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010
CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison GomoryHu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected
More informationON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction
ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove
More informationAll trees contain a large induced subgraph having all degrees 1 (mod k)
All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New
More informationGROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.
Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the
More informationFundamentals of Media Theory
Fundamentals of Media Theory ergei Ovchinnikov Mathematics Department an Francisco tate University an Francisco, CA 94132 sergei@sfsu.edu Abstract Media theory is a new branch of discrete applied mathematics
More information5.1 Bipartite Matching
CS787: Advanced Algorithms Lecture 5: Applications of Network Flow In the last lecture, we looked at the problem of finding the maximum flow in a graph, and how it can be efficiently solved using the FordFulkerson
More informationOptimal 3D Angular Resolution for LowDegree Graphs
Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 17, no. 3, pp. 173 200 (2013) DOI: 10.7155/jgaa.00290 Optimal 3D Angular Resolution for LowDegree Graphs David Eppstein 1 Maarten Löffler
More informationDegreeassociated reconstruction parameters of complete multipartite graphs and their complements
Degreeassociated reconstruction parameters of complete multipartite graphs and their complements Meijie Ma, Huangping Shi, Hannah Spinoza, Douglas B. West January 23, 2014 Abstract Avertexdeleted subgraphofagraphgisacard.
More informationarxiv: v2 [math.co] 30 Nov 2015
PLANAR GRAPH IS ON FIRE PRZEMYSŁAW GORDINOWICZ arxiv:1311.1158v [math.co] 30 Nov 015 Abstract. Let G be any connected graph on n vertices, n. Let k be any positive integer. Suppose that a fire breaks out
More informationAnalysis of Algorithms, I
Analysis of Algorithms, I CSOR W4231.002 Eleni Drinea Computer Science Department Columbia University Thursday, February 26, 2015 Outline 1 Recap 2 Representing graphs 3 Breadthfirst search (BFS) 4 Applications
More informationExtreme Intersection Points in Arrangements of Lines
Extreme Intersection Points in Arrangements of Lines Rom Pinchasi August 1, 01 Abstract We provide a strengthening of the classical theorem of Erdős [3] saing that n lines in the plane, no two of which
More informationOn the kpath cover problem for cacti
On the kpath cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we
More informationCycle transversals in bounded degree graphs
Electronic Notes in Discrete Mathematics 35 (2009) 189 195 www.elsevier.com/locate/endm Cycle transversals in bounded degree graphs M. Groshaus a,2,3 P. Hell b,3 S. Klein c,1,3 L. T. Nogueira d,1,3 F.
More informationOn three zerosum Ramseytype problems
On three zerosum Ramseytype problems Noga Alon Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel and Yair Caro Department of Mathematics
More informationGraph Theory Problems and Solutions
raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationThe Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.
The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,
More informationMathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
More informationDefinition 11.1. Given a graph G on n vertices, we define the following quantities:
Lecture 11 The Lovász ϑ Function 11.1 Perfect graphs We begin with some background on perfect graphs. graphs. First, we define some quantities on Definition 11.1. Given a graph G on n vertices, we define
More information