Algorithms. Social Graphs. Algorithms


 Caroline Montgomery
 10 months ago
 Views:
Transcription
1 Algorithms Social Graphs Algorithms
2 Social Graphs Definition I: A social graph contains all the friendship relations (edges) among a group of n people (vertices). The friendship relationship is symmetric. Two vertices with no edge between them are enemies. Definition ( II: In a social graph with n vertices, all the n ) 2 edges are colored either by blue (friends) or by red (enemies). Algorithms 1
3 Statement I Theorem: There is no group of 7 people such that each person in the group has exactly 3 friends in the group. Proof: The handshaking lemma: In any graph the sum of all the degrees is even. Because each edge contributes exactly 2 to this sum. The sum of all degrees in a graph with 7 vertices for which all degrees are 3 is 21 which is odd. Therefore, such a graph is impossible. Algorithms 2
4 Statement II Theorem: In any group of n 2 people, there are at least 2 people with the same number of friends in the group. Proof: In a graph with n vertices, 0,1,...,n 1 are the only possible values for a degree of a vertex. If each vertex has a distinct degree, then there must be a vertex v with degree d(v) = n 1 and a vertex u with degree d(u) = 0. But d(v) = n 1 implies that d(u) 1; a contradiction. Algorithms 3
5 Statement III Theorem: There exists a group of 5 people for which no 3 are mutual friends and no 3 are mutual enemies. Proof: The following coloring of the edges of K 5 with blue or red is the only (up to a symmetry) coloring with no unicolored triangle. Algorithms 4
6 Statement IV Theorem: Every group of 6 people contains either three mutual friends or three mutual enemies. Proof: Consider vertex A. A has either 3 friends or 3 enemies. Assume B,C,D are 3 friends of A. If any of the 3 pairs BC,CD,BD are friends, then this pair with A form a friendship triangle. Otherwise, BCD is a triangle of enemies. Algorithms 5
7 Statement IV Corollary I: If a vertex found a triangle that contains itself, then the following is a subcoloring of the graph: Corollary II: If a vertex found a triangle that does not contain itself, then the following is a subcoloring of the graph: Algorithms 6
8 Statement V Theorem: A social graph with 6 vertices contains at least 2 unicolored triangles (not necessarily of the same color). Remark: There are only 3 possible colorings (up to a symmetry) for a graph with 6 vertices and only 2 unicolored triangles. Algorithms 7
9 Proof I: Case Analysis Let ABC be a unicolored triangle found by Statement IV and let D, E, and F be the other 3 vertices. If DEF is also a unicolored triangle, then it is the second unicolored triangle. Otherwise, one of DE, DF, EF is not colored as the unicolored triangle. Assume ABC is a blue triangle and the DE is a red edge. Algorithms 8
10 Proof I: Case Analysis If either D or E is connected to ABC with 2 blue edges, then a second blue triangle is found. Algorithms 9
11 Proof I: Case Analysis Otherwise, D and E each is connected to ABC with at least 2 red edges. Therefore, at least 1 vertex from ABC is connected to both D and E with red edges. Let this vertex be A. ADE is a red triangle. Algorithms 10
12 Proof II: Based on Statement III Assume that there exists only one unicolored triangle. Omit one of the vertices of this triangle. By Statement III, the remaining 5 vertices are colored with a blue 5ring and a red 5ring. Let the omitted vertex be A. Algorithms 11
13 Proof II: Based on Statement III A has either at least 3 blue edges or at least 3 red edges. Assume B,C,D are 3 blue neighbors of A. If B,C,D are 3 consecutive vertices on the blue 5ring, then ABC and ACD are blue triangles. Algorithms 12
14 Proof II: Based on Statement III If A has at least 4 blue neighbors, then at least 3 of them are consecutive on the blue 5ring. In the remaining case, A has exactly 2 red neighbors, say D and E that must be adjacent on the red 5ring. ADE is a red triangle. Algorithms 13
15 Proof III: Based on Statement IV Assume towards contradiction that there exists only 1 unicolored triangle ABC. Assume ABC is a blue triangle. Case I: There exists a blue edge connected to the triangle. Assume that A has another blue neighbor D. Corollaries I and II of Statement IV imply that D must find another unicolored triangle. Algorithms 14
16 Proof III: Based on Statement IV Case II: Assume that the blue triangle ABC is connected to the rest of the vertices D,E,F with red edges. Algorithms 15
17 Proof III: Based on Statement IV If any of the pair DE,DF,EF is a red pair, then this pair form 3 red triangles with A,B,C. Otherwise, DEF is the second blue triangle. Algorithms 16
18 Proof IV: Counting There are exactly 20 = ( 6 3) distinct triangles in the complete graph K 6. Assume a coloring of the edges of K 6 with blue and red. Let T be the number of non unicolored triangles. Let S be the number of pairs of edges that intersect such that each edge is colored with a different color. Algorithms 17
19 Proof IV: Counting Each unicolored triangle contributes nothing to S wheras a non unicolored triangle contributes 2 to S. S = 2T. Each vertex contributes at most 2 3 = 6 to S in case it has 2 edges of one color and 3 edges of the other color. S 6 6 = 36. It follows that 2T 36 implying that T 18. There are at least 2 unicolored triangles. Algorithms 18
20 Coloring Edges with 3Colors Theorem: 17 people discuss 3 topics among themselves where each pair discusses only 1 topic. Then, there are at least 3 people who discuss among themselves the same topic. Proof: Consider vertex A. There is a topic that A discusses with at least 6 people. If 2 of these 6 people, B and C, discuss this topic, then A,B,C are 3 people that discuss the same topic. Otherwise, these 6 people discuss among themselves only 2 topics. By Statement IV, there are 3 people among these 6 people who discuss the same topic. Algorithms 19
21 Ramsey Numbers R(h,l) is the minimum integer n such that any graph with n vertices contains either a clique with h vertices or an independent set with l vertices. R(h,l) is the minimum integer n such that any coloring of the edges of the complete graph K n with the colors blue and red creates either a red clique of size h or a blue clique of size l. Statements III and IV imply that R(3,3) = 6. Algorithms 20
22 Ramsey Numbers: Observations and Known Bounds R(h,l) = R(l,h). R(2,l) = l R(h,h) 4R(h 2,h) + 2. h2h/2 e 2 R(h,h) c 1 l 2 ln l R(3,l) c 2 l2 ln l for some constants c 1 < c 2. Algorithms 21
23 Generalized Ramsey Numbers Let G be a family of graphs. Examples: K n, N n, C n, trees, binary trees,... R(G,k) is the minimum integer n such that any coloring of the edges of the complete graph K n with k colors has a monochromatic subgraph G from the family G. R(G,2) is the minimum integer n such that for any graph with n vertices either the graph or its complement has a subgraph isomorphic to a graph G from the family G. Algorithms 22
24 Examples R({K 3 },2) = 6. Statement III implies that R({K 3 },2) > 5. Statement IV implies that R({K 3 },2) 6. R({K 3,C 5 },2) = 5. Statement III implies that R({K 3,C 5 },2) 5. Trivially R({K 3 },2) > 4. R({K 3 },3) 17. From the 17 people who discuss 3 topics statement. Algorithms 23
25 Statement VI Theorem: In any group of n 1 people, there exists a committee of 1 k n members such that no 2 committee members are friends and every person not included in the committee is a friend of at least 1 committee member. Proof: Construct the following committee. As long as there exists a vertex v in the graph: Add v to the committee. Omit v and all of its neighbors from the graph. Algorithms 24
26 Statement VI The algorithm is correct: Let u and v be 2 members in the committee. Assume v joined the committee first. Then u cannot be a neighbor of v. The committee is an independent set. Let w be a noncommittee vertex. Then w has a neighbor v that is a committee member that caused w not to be a committee member. The committee is a dominating set. Algorithms 25
27 Statement VII Theorem: Any group of n 2 people can be partitioned into 2 subgroups such that at least half the friends of each person belong to the subgroup of which that person is not a member. Notations: Let P be a partition of the set of all vertices V into 2 disjoint sets: Denote by d s (v) the degree of v in its own set. Èv V Let d s(v) 2 be the number of contained edges in P. Denote by d o (v) the degree of v in the other set. Èv V Let d o(v) 2 be the number of crossed edges in P. Algorithms 26
28 Statement VII: A Constructive Proof Algorithm: Start with an arbitrary partition P. As long as there exists a vertex v such that d s (v) > d o (v), transfer v to the other set. Correctness: If the algorithm terminates, then in the final partition d s (v) d o (v) for any vertex v. Algorithms 27
29 Statement VII: Termination Proof Define D(P) to be the difference between the number of cross edges and contained edges for the partition P. D(P) = 1 2 v V (d o(v) d s (v)). Let Q be the partition after transferring v to the other set in teh partition P. D(Q) = D(P) + 2(d s (v) d o (v)) > D(P). Since D(Q) terminates. n2 4 for any partition, the algorithm Algorithms 28
30 Statement VIII Theorem: Suppose everyone in a group of n 3 people is a friend of at least half the people in the group. It is possible to seat the group around a table in such a way that everyone is seated between 2 of their friends. Equivalent Theorem: Let G be a simple undirected graph with n 3 vertices. Assume that d(v) n 2 for any vertex v. Then there exists a Hamilton Circuit in G. Proof: A greedy algorithm finds the Hamilton circuit. Algorithms 29
31 Statement IX Theorem: Suppose in a group of n 2 people, any pair has precisely one common friend. Then there is always a person (the politician ) who is everybody s friend. Equivalent Theorem: Let G be a simple undirected graph with n vertices. Assume that any 2 vertices have precisely one common neighbor. Then there exists a vertex v that is adjacent to all other vertices. Algorithms 30
32 Statement IX: The Windmill Graph A stronger statement: The only possible graphs are the windmill graphs for odd n 3. Algorithms 31
33 Statement IX: Proof Outline Assume that there exists a graph G obeying the theorem s conditions that is not a windmill graph. G must be a dregular graph: d(v) = d for each vertex v. d 2 d + 1 = n. This is impossible. Algorithms 32
34 Statement IX: Infinite Graphs There exists an infinite graph without a vertex that is a neighbor to all other vertices such that every pair of vertices has exactly one common neighbor. Start with a 5ring and add a new vertex when needed to satisfy the condition for any pair of vertices. Algorithms 33
Graph Algorithms. Vertex Coloring. Graph Algorithms
Graph Algorithms Vertex Coloring Graph Algorithms The Input Graph G = (V, E) a simple and undirected graph: V : a set of n vertices. E: a set of m edges. A A B C D E F C F D E B A 0 1 1 1 0 0 B 1 0 1 0
More informationRAMSEY THEORY. Ramsey Theory
RAMSEY THEORY Ramsey s Theorem Suppose we 2colour the edges of K 6 of Red and Blue. There must be either a Red triangle or a Blue triangle. This is not true for K 5. 2 R 1 R R 3 4 5 There are 3 edges
More informationCourse Notes for CS336: Graph Theory
Course Notes for CS336: Graph Theory Jayadev Misra The University of Texas at Austin 5/11/01 Contents 1 Introduction 1 1.1 Basics................................. 2 1.2 Elementary theorems.........................
More informationDefinition 3. We define R(k, m) to be the smallest n such that whenever we 2colour a K n red and blue, we always get either a red K k or a blue K m.
Ramsey Theory We begin with a simple question: How many people do we need to have at a party to ensure that we can find either 3 of them who all know each other, or 3 of them who are all strangers to each
More informationHOMEWORK 3. e 1 K 1 K 2 SOLUTIONS
HOMEWORK 3 SOLUTIONS (1) Show that for each n N the complete graph K n is a contraction of K n,n. Solution: We describe the process for several small values of n. In this way, we can discern the inductive
More information2. Graph Terminology
2. GRAPH TERMINOLOGY 186 2. Graph Terminology 2.1. Undirected Graphs. Definitions 2.1.1. Suppose G = (V, E) is an undirected graph. (1) Two vertices u, v V are adjacent or neighbors if there is an edge
More informationGraph Theory. 1 Defining and representing graphs
Graph Theory 1 Defining and representing graphs A graph is an ordered pair G = (V, E), where V is a finite, nonempty set of objects called vertices, and E is a (possibly empty) set of unordered pairs
More informationDefinition A tree is a connected, acyclic graph. Alternately, a tree is a graph in which any two vertices are connected by exactly one simple path.
11.5 Trees Examples Definitions Definition A tree is a connected, acyclic graph. Alternately, a tree is a graph in which any two vertices are connected by exactly one simple path. Definition In an undirected
More informationGRAPH THEORY: INTRODUCTION
GRAPH THEORY: INTRODUCTION DEFINITION 1: A graph G consists of two finite sets: a set V (G) of vertices a set E(G) of edges, where each edge is associated with a set consisting of either one or two vertices
More information1. Relevant standard graph theory
Color identical pairs in 4chromatic graphs Asbjørn Brændeland I argue that, given a 4chromatic graph G and a pair of vertices {u, v} in G, if the color of u equals the color of v in every 4coloring
More informationDefinition. A graph is a collection of vertices, and edges between them. They are often represented by a drawing:
1. GRAPHS AND COLORINGS Definition. A graph is a collection of vertices, and edges between them. They are often represented by a drawing: 3 vertices 3 edges 4 vertices 4 edges 4 vertices 6 edges A graph
More informationGraph Algorithms. Edge Coloring. Graph Algorithms
Graph Algorithms Edge Coloring Graph Algorithms The Input Graph A simple and undirected graph G = (V,E) with n vertices in V, m edges in E, and maximum degree. Graph Algorithms 1 Matchings A matching,
More informationBasic Notions on Graphs. Planar Graphs and Vertex Colourings. Joe Ryan. Presented by
Basic Notions on Graphs Planar Graphs and Vertex Colourings Presented by Joe Ryan School of Electrical Engineering and Computer Science University of Newcastle, Australia Planar graphs Graphs may be drawn
More informationLecture 7,8 (Sep 22 & 24, 2015):Facility Location, KCenter
,8 CMPUT 675: Approximation Algorithms Fall 2015 Lecture 7,8 (Sep 22 & 24, 2015):Facility Location, KCenter Lecturer: Mohammad R. Salavatipour Scribe: Based on older notes 7.1 Uncapacitated Facility Location
More informationExcluding pairs of graphs
Excluding pairs of graphs Maria Chudnovsky 1 Columbia University, New York, NY 10027, USA Alex Scott Mathematical Institute, University of Oxford, 2429 St Giles, Oxford OX1 3LB, UK Paul Seymour 2 Princeton
More informationMTH 548 Graph Theory Fall 2003
MTH 548 Graph Theory Fall 2003 Lesson 6  Planar graphs Planar graph plane drawing  plane graph face length of a face infinite face Thm 12: Euler. Let G be a plane drawing of a connected planar graph.
More informationwith Bidirectional Links
Connected Dominating Sets in Disk Graphs 1 with Bidirectional Links My T. Thai and DingZhu Du Abstract In this paper, we study the Connected Dominating Set (CDS) problem in disk graphs. The CDS problem
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 informationJANUSZ ADAMUS. for every pair of nonadjacent vertices x and y, then G contains a cycle of length n k, unless G is bipartite and n k 1 (mod 2).
A NOTE ON A DEGREE SUM CONDITION FOR LONG CYCLES IN GRAPHS arxiv:0711.4394v1 [math.co] 28 Nov 2007 JANUSZ ADAMUS Abstract. We conjecture that a graph of order n, in which d(x)+d(y) n k for every pair of
More information1. Outline. Definition 2. A coloring of a graph is an assignment of colors (living in some finite set {c 1,..., c r }) to the edges of the graph.
. Outline () Basic Graph Theory and graph coloring (2) Pigeonhole Principle (3) Definition and examples of Ramsey Numbers  R(3), R(3, 3, 3) (4) Generalized Ramsey Numbers and Ramsey s Theorem (5) Erdös
More informationGraph theory. PoShen Loh. June 2012
Graph theory PoShen Loh June 2012 At first, graph theory may seem to be an ad hoc subject, and in fact the elementary results have proofs of that nature. The methods recur, however, and the way to learn
More informationOnline Ramsey Theory for Planar Graphs
Online Ramsey Theory for Planar raphs Šárka Petříčková Department of Mathematics University of West Bohemia Univerzitní 8, 306 14 Plzeň, Czech Republic sarpet@kma.zcu.cz Submitted: Dec 1, 2012; Accepted:
More informationCHAPTER 2. Graphs. 1. Introduction to Graphs and Graph Isomorphism
CHAPTER 2 Graphs 1. Introduction to Graphs and Graph Isomorphism 1.1. The Graph Menagerie. Definition 1.1.1. A simple graph G = (V, E) consists of a set V of vertices and a set E of edges, represented
More informationSubgraphs and Paths and Cycles
15 October, 2015 Subgraphs Definition Let G = (V, E) be a graph. Graph H = (V, E ) is a subgraph of G if V V and E E. Subgraphs Definition Let G = (V, E) be a graph. Graph H = (V, E ) is a subgraph of
More informationOn the minimal length of the longest trail in a fixed edgedensity graph
Cent Eur J Math 11(10 013 18311837 DOI: 10478/s11533013085x Central European Journal of Mathematics On the minimal length of the longest trail in a fixed edgedensity graph Research Article Vajk Szécsi
More informationGraph theory. PoShen Loh. June We begin by collecting some basic facts which can be proved via barehands techniques.
Graph theory PoShen Loh June 011 1 Wellknown results We begin by collecting some basic facts which can be proved via barehands techniques. 1. The sum of all of the degrees is equal to twice the number
More informationL(3, 2, 1)Labeling of Simple Graphs
L(3,, 1)Labeling of Simple Graphs Jean Clipperton Simpson College, IA jean.clipperton@simpson.edu Jessica Gehrtz Concordia CollegeMoorhead, MN jrgehrtz@cord.edu Zsuzsanna Szaniszlo Valparaiso University,
More informationBreadth First Search
Breadth First Search BFS intuition. Explore outward from s in all possible directions, adding nodes one "layer" at a time. BFS algorithm. L 0 = { s }. L 1 = all neighbors of L 0. s L 1 L 2 L n1 L 2 =
More informationCombinatorics: The Fine Art of Counting
Combinatorics: The Fine Art of Counting Week 9 Lecture Notes Graph Theory For completeness I have included the definitions from last week s lecture which we will be using in today s lecture along with
More information3. Euler and Hamilton Paths
3. EULER AND HAMILTON PATHS 82 3. Euler and Hamilton Paths 3.1. Euler and Hamilton Paths. Definitions 3.1.1. (1) An Euler Circuit in a graph G is a path in G that uses every edge exactly once and begins
More informationMathematics 1. Part I: Graph Theory. Exercises and problems
Bachelor Degree in Informatics Engineering Barcelona School of Informatics Mathematics 1 Part I: Graph Theory Exercises and problems February 2015 Departament de Matemàtica Aplicada 2 Universitat Politècnica
More informationIn this section, we shall assume (except where noted) that graphs are loopless.
6 Graph Colouring In this section, we shall assume (except where noted) that graphs are loopless. Upper and Lower Bounds Colouring: A kcolouring of a graph G is a map φ : V (G) S where S = k with the
More informationChapter4: Perfect Domination. Chapter4: PERFECT DOMINATION
Chapter4: PERFECT DOMINATION 92 Perfect Domination is closely related to Perfect Codes and Perfect Codes have been used in Coding Theory. In this chapter we study the effect of removing a vertex from
More informationSecondary VertexEdge Glossary
adjacent vertices Two vertices that are connected by an (neighboring vertices) E D A B C A and B are neighboring or adjacent vertices arc A synonym for chromatic number The least number of colors it takes
More informationOrdering without forbidden patterns
Ordering without forbidden patterns Pavol Hell Bojan Mohar Arash Rafiey Abstract Let F be a set of ordered patterns, i.e., graphs whose vertices are linearly ordered. An Ffree ordering of the vertices
More information1 Introduction to Graph Theory
CHAPTER 1 Introduction to Graph Theory INTRODUCTION It is no coincidence that graph theory has been independently discovered many times, since it may quite properly be regarded as an area of applied mathematics.
More informationON COLORING CLAWFREE GRAPHS
ON COLORING CLAWFREE GRAPHS JED YANG Final Report October 29, 2007 Abstract. A graph G is kclawfree if no vertex has k pairwise nonadjacent neighbors. A proper kcoloring of G is a map from the vertex
More informationBipartite Graphs and Problem Solving
Bipartite Graphs and Problem Solving Jimmy Salvatore University of Chicago August 8, 2007 Abstract This paper will begin with a brief introduction to the theory of graphs and will focus primarily on the
More informationTwoConnected Steiner Networks: Structural Properties
TwoConnected Steiner Networks: Structural Properties Pawel Winter and Martin Zachariasen Dept. of Computer Science, University of Copenhagen Universitetsparken, DK200 Copenhagen Ø, Denmark email: pawel,martinz
More informationProblem Set #11 solutions
5.1.8. Find three nonisomorphic graphs with the same degree sequence (1, 1, 1,,, 3). There are several such graphs: three are shown below. 5.1.10. Show that two projections of the Petersen graph are isomorphic.
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 informationSection I.7. Generating Sets and Cayley Digraphs
I.7 Generating Sets 1 Section I.7. Generating Sets and Cayley Digraphs Note. In this section, we generalize the idea of a single generator of a group to a whole set of generators of a group. Remember,
More informationGraphs with four boundary vertices
Graphs with four boundary vertices Tobias Müller Attila Pór JeanSébastien Sereni Abstract A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G from u to
More informationChapter 1 Symmetry Breaking 1: Vertex Coloring
Principles of Distributed Computing Roger Wattenhofer, Summer 2004 Chapter 1 Symmetry Breaking 1: Vertex Coloring Section 1.1: Introduction (Useful toy problem to see style of lecture) (Vertex coloring
More informationGraph Theory. 1.1 Graph: Prepared by M. Aurangzeb Updated: Monday, March 15, 2010
Prepared by M. Aurangzeb Updated: Monday, March 15, 2010 Graph Theory Graph theory is the branch of mathematics which deals with entities and their mutual relationships. The entities are represented by
More informationarxiv: v1 [math.co] 26 Jan 2016
Vertex Colorings without Rainbow or Monochromatic Subgraphs Wayne Goddard and Honghai Xu Dept of Mathematical Sciences, Clemson University Clemson SC 29634 {goddard,honghax}@clemson.edu arxiv:1601.06920v1
More informationDiscrete Mathematics (Math 510) Fall Definitions and Theorems
Discrete Mathematics (Math 510) Fall 2014 Definitions and Theorems Gerald Hoehn October 12, 2014 Chapter 1 Graph Theory 1.1 Basics Definition 1.1. A graph G is an ordered pair (V,E) of disjoint finite
More informationa b if and only if a b.
3. Cosets Consider the group of integers Z under addition. Let H be the subgroup of even integers. Notice that if you take the elements of H and add one, then you get all the odd elements of Z. In fact
More informationBasic Combinatorics. Math 40210, Section 01 Fall Basic graph definitions
Basic Combinatorics Math 40210, Section 01 Fall 2012 Basic graph definitions It may seem as though the beginning of graph theory comes with a lot of definitions. This may be so, but hopefully by repeatedly
More informationGRAPH CONNECTIVITY. 9 Elementary Properties
9 Elementary Properties 30 GRAPH CONNECTIVITY 9 Elementary Properties Definition 9.1: A graph G is said to be connected if for every pair of vertices there is a path joining them. The maximal connected
More informationSolutions to Exercises Chapter 11: Graphs
Solutions to Exercises Chapter 11: Graphs 1 There are 34 nonisomorphic graphs on 5 vertices (compare Exercise 6 of Chapter 2). How many of these are (a) connected, (b) forests, (c) trees, (d) Eulerian,
More information2. Determine each of the 11 nonisomorphic graphs of order 4, and give a planar representation of each.
Chapter 11 Homework. Determine each of the 11 nonisomorphic graphs of order 4, and give a planar representation of each. 3. Does there exist a graph of order 5 whose degree sequence equals (4, 4, 3,, )?
More information1 Cliques and Independent Sets. Definition 1
1 Cliques and Independent Sets Definition 1 A set of vertices is called independent if no two vertices in the set are adjacent. A set of vertices is called a clique if every two vertices in the set are
More informationMinimal forbidden sets for degree sequence characterizations
University of Rhode Island DigitalCommons@URI Mathematics Faculty Publications Mathematics 2015 Minimal forbidden sets for degree sequence characterizations Michael D. Barrus University of Rhode Island,
More informationOverview. Relations and Their Properties Equivalence Relations Partial Orderings
Chapter 9 Overview Relations and Their Properties Equivalence Relations Partial Orderings Section 9.1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R A B. Example:
More informationMatrix techniques for strongly regular graphs and related geometries
Matrix techniques for strongly regular graphs and related geometries Supplement to the notes of W. Haemers Intensive Course on Finite Geometry and its Applications, University of Ghent, April 314, 2000
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 informationTHE FRIENDSHIP THEOREM
THE FRIENDSHIP THEOREM ELIZABETH WALKER Abstract. In this paper we explore the friendship theorem, which in graph theory is stated as if we have a finite graph in which any two nodes have exactly one common
More informationCS173 Lecture B, November 17, 2015
CS173 Lecture B, November 17, 2015 Tandy Warnow November 17, 2015 CS 173, Lecture B November 17, 2015 Tandy Warnow Today s material Adjacency matrices and adjacency lists (and a class exercise) Depthfirst
More information1 The Minimum Spanning Tree (MST) Problem
IEOR269: Lecture 3 1 Integer Programming and Combinatorial Optimization Lecture #3 IEOR 269 Feb 5, 2010 Lecturer: Dorit Hochbaum Scribe: Dogan Bilguvar Handouts: Game of Fiver and Fire Station Problems
More informationConnections Between the Matching and Chromatic Polynomials
Connections Between the Matching and Chromatic Polynomials E.J. Farrell Earl Glen Whitehead JR Presented by Doron Tiferet Outline The following presentation will focus on two main results: 1. The connection
More informationTriangle deletion. Ernie Croot. February 3, 2010
Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,
More informationA BRIEF INTRODUCTION TO RAMSEY THEORY OF GRAPHS
A BRIEF INTRODUCTION TO RAMSEY THEORY OF GRAPHS JUSTIN WALKER Abstract. This paper provides proof of Ramsey's Theorem as it applies to (undirected) graphs, along with a short discussion of the thereom
More informationThe kcenter problem February 14, 2007
Sanders/van Stee: Approximations und OnlineAlgorithmen 1 The kcenter problem February 14, 2007 Input is set of cities with intercity distances (G = (V,V V )) Select k cities to place warehouses Goal:
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 informationClawfree Graphs VI. Colouring Clawfree Graphs
Clawfree Graphs VI. Colouring Clawfree Graphs Maria Chudnovsky Columbia University, New York NY 1007 1 and Paul Seymour Princeton University, Princeton NJ 085 May 7, 009 1 This research was partially
More informationINEQUALITIES OF NORDHAUS GADDUM TYPE FOR CONNECTED DOMINATION
INEQUALITIES OF NORDHAUS GADDUM TYPE FOR CONNECTED DOMINATION H. KARAMI DEPARTMENT OF MATHEMATICS SHARIF UNIVERSITY OF TECHNOLOGY P.O. BOX 11365915 TEHRAN, I.R. IRAN S.M. SHEIKHOLESLAMI DEPARTMENT OF
More informationChapter 5: Connectivity Section 5.1: Vertex and EdgeConnectivity
Chapter 5: Connectivity Section 5.1: Vertex and EdgeConnectivity Let G be a connected graph. We want to measure how connected G is. Vertex cut: V 0 V such that G V 0 is not connected Edge cut: E 0 E
More information1 Cliques and Independent Sets. Definition 1
1 Cliques and Independent Sets Definition 1 A set of vertices is called independent if no two vertices in the set are adjacent. A set of vertices is called a clique if every two vertices in the set are
More informationCS5314 Randomized Algorithms. Lecture 17: Probabilistic Method (Introduction)
CS5314 Randomized Algorithms Lecture 17: Probabilistic Method (Introduction) 1 Objectives Introduce Probabilistic Method a powerful way of proving existence of certain objects Idea: If a certain object
More informationHOMEWORK #3 SOLUTIONS  MATH 3260
HOMEWORK #3 SOLUTIONS  MATH 3260 ASSIGNED: FEBRUARY 26, 2003 DUE: MARCH 12, 2003 AT 2:30PM (1) Show either that each of the following graphs are planar by drawing them in a way that the vertices do not
More informationPlanarity Planarity
Planarity 8.1 71 Planarity Up until now, graphs have been completely abstract. In Topological Graph Theory, it matters how the graphs are drawn. Do the edges cross? Are there knots in the graph structure?
More informationConnectivity, Graph Minors, and Subgraph Multiplicity
Connectivity, Graph Minors, and Subgraph Multiplicity David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717 January 5, 1993 Abstract It is well known
More information2. Lecture notes on nonbipartite matching
Massachusetts Institute of Technology Handout 5 8.433: Combinatorial Optimization February 8th, 009 Michel X. Goemans. Lecture notes on nonbipartite matching Given a graph G = (V, E), we are interested
More informationMAD 3105 PRACTICE TEST 2 SOLUTIONS
MAD 3105 PRACTICE TEST 2 SOLUTIONS 1. Define a graph G with V (G) = {a, b, c, d, e}, E(G) = {r, s, t, u, v, w, x, y, z} and γ, the function defining the edges, is given by the table ɛ r s t u v w x y z
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 informationLecture 4: The Chromatic Number
Introduction to Graph Theory Instructor: Padraic Bartlett Lecture 4: The Chromatic Number Week 1 Mathcamp 2011 In our discussion of bipartite graphs, we mentioned that one way to classify bipartite graphs
More informationHonours Graph Theory
University of Zimbabwe HMTH215 Graph Theory Honours Graph Theory Author: P. Mafuta Department: Mathematics April 6, 2016 Chapter 1 Introduction: Basic Graph Theory This course serves to answer many questions
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 informationMTH 548 Graph Theory Fall 2003 Lesson 4  Paths and Cycles Walk, Trail, Path length= number of edges Connected graph, components circuit=closed
MTH 548 Graph Theory Fall 2003 Lesson 4  Paths and Cycles Walk, Trail, Path length= number of edges Connected graph, components circuit=closed trail, cycle=closed path Thm 3: u, vwalk implies u, vpath.
More informationSaturation Numbers of Books
Saturation Numbers of Books Guantao Chen Dept. of Math. and Stat. Georgia State University Atlanta, GA 30303 gchen@gsu.edu Ronald J. Gould Ralph J. Faudree Dept. of Math. Sciences University of Memphis
More information(Vertex) Colorings. We can properly color W 6 with. colors and no fewer. Of interest: What is the fewest colors necessary to properly color G?
Vertex Coloring 2.1 37 (Vertex) Colorings Definition: A coloring of a graph G is a labeling of the vertices of G with colors. [Technically, it is a function f : V (G) {1, 2,..., c}.] Definition: A proper
More informationWhen n pigeons are put into k pigeonholes, there exists at least 1 pigeonhole containing not less
PIGEONHOLE PRINCIPLE Mathematical Database Pigeonhole principle is a fundamental but powerful tool in combinatorics. Unlike many other strong theorems, the principle itself is exceptionally simple. Unless
More informationarxiv: v2 [math.co] 8 Mar 2016
> k HOMOGENEOUS INFINITE GRAPHS OVE AHLMAN arxiv:1601.07307v2 [math.co] 8 Mar 2016 Abstract. In this article we give an explicit classification for the countably infinite graphs G which are, for some k,
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 informationMATH 2420 Discrete Mathematics Lecture notes
MATH 2420 Discrete Mathematics Lecture notes Graphs Objectives Graphs 1. Identify loops, parallel edges, etc. in a graph. 2. Draw the complete graph on n vertices, and the complete bipartite graph on (m,n)
More informationDO NOT REDISTRIBUTE THIS SOLUTION FILE
Professor Kindred Math 04 Graph Theory Homework 7 Solutions April 3, 03 Introduction to Graph Theory, West Section 5. 0, variation of 5, 39 Section 5. 9 Section 5.3 3, 8, 3 Section 7. Problems you should
More information3. Markov property. Markov property for MRFs. HammersleyClifford theorem. Markov property for Bayesian networks. Imap, Pmap, and chordal graphs
Markov property 33. Markov property Markov property for MRFs HammersleyClifford theorem Markov property for ayesian networks Imap, Pmap, and chordal graphs Markov Chain X Y Z X = Z Y µ(x, Y, Z) = f(x,
More informationColor fixation, color identity and the Four Color Theorem
Color fixation, color identity and the Four Color Theorem Asbjørn Brændeland I argue that there is no 4chromatic planar graph with a joinable pair of color identical vertices, i.e., given a 4chromatic
More information2 the electronic journal of combinatorics 6 (1999), #R11 Here a circuit is a minimal nonface. For convenience we will name two graphs: The graph on t
NimRegularity of Graphs Nathan Reading School of Mathematics, University of Minnesota Minneapolis, MN 55455 reading@math.umn.edu Submitted: November 24, 1998; Accepted: January 22, 1999 Abstract. Ehrenborg
More informationCSL851: Algorithmic Graph Theory Semester I Lecture 1: July 24
CSL851: Algorithmic Graph Theory Semester I 20132014 Lecture 1: July 24 Lecturer: Naveen Garg Scribes: Suyash Roongta Note: LaTeX template courtesy of UC Berkeley EECS dept. Disclaimer: These notes have
More informationMonochromatic cycle partitions of edgecolored graphs
Monochromatic cycle partitions of edgecolored graphs Gábor N. Sárközy Computer Science Department Worcester Polytechnic Institute Worcester, MA, USA 01609 gsarkozy@cs.wpi.edu and Computer and Automation
More informationarxiv: v2 [math.co] 31 Oct 2016
arxiv:1606.018v [math.co] 1 Oct 016 Improved approximative multicoloring of hexagonal graphs Janez Žerovnik FME, University of Ljubljana, Aškerčeva 6, SI1000 Ljubljana, Slovenia janez.zerovnik@fs.unilj.si
More informationAALBORG UNIVERSITY. Total domination in partitioned graphs. Allan Frendrup, Preben Dahl Vestergaard and Anders Yeo
AALBORG UNIVERSITY Total domination in partitioned graphs by Allan Frendrup, Preben Dahl Vestergaard and Anders Yeo R200906 April 2009 Department of Mathematical Sciences Aalborg University Fredrik Bajers
More information1 Approximation Algorithms: Vertex Cover
Approximation Algorithms: Vertex Cover. Introduction to Approximation Algorithms There are several optimization problems such as Minimum Spanning Tree (MST), MinCut, Maximum Matching, in which you can
More informationNeighborhood Unions and Independent Cycles
Neighborhood Unions and Independent Cycles Ronald J. Gould Kazuhide Hirohata Paul Horn Abstract In this paper, we investigate sufficient conditions on the neighborhood of independent vertices which imply
More informationLucky Choice Number of Planar Graphs with Given Girth
Lucky Choice Number of Planar Graphs with Given Girth Axel Brandt, Jennifer Diemunsch, Sogol Jahanbekam January 6, 015 Abstract Suppose the vertices of a graph G are labeled with real numbers. For each
More informationTotal domination of graphs and small transversals of hypergraphs.
Total domination of graphs and small transversals of hypergraphs. Stéphan Thomassé and Anders Yeo Abstract The main result of this paper is that every 4uniform hypergraph on n vertices and m edges has
More informationTHE 0/1BORSUK CONJECTURE IS GENERICALLY TRUE FOR EACH FIXED DIAMETER
THE 0/1BORSUK CONJECTURE IS GENERICALLY TRUE FOR EACH FIXED DIAMETER JONATHAN P. MCCAMMOND AND GÜNTER ZIEGLER Abstract. In 1933 Karol Borsuk asked whether every compact subset of R d can be decomposed
More informationGraphs with four boundary vertices
Graphs with four boundary vertices Tobias Müller Attila Pór JeanSébastien Sereni Submitted: Feb 17, 2009; Accepted: Dec 17, 2010; Published: Jan 5, 2011 Mathematics Subject Classification: 05C75 Abstract
More information