DOCSLIB.ORG

Block-Intersection Graph of Pairwise Balance Designs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Block-Intersection Graph of Pairwise Balance Designs Acquisitions and Bib!iogaphic Services Branch 395 V./e!!rng!cn Street OZawa. Ontario K! A QNJ NOTICE The quality of this microform is La qualite de cette microforme heavily dependent upon the d4pend grandement de la qualite quality of the original thesis de la these soumise au submitted for microfilming. microfiimage. Nous avons tout Every effort has been made to fait pour assurer une qualite -. ensure the highest quality of superieure de reproduction. reproduction possible. If pages are missing, contact the 8'il manque des pages, veuillez university which granted the communiquer avec I'universite degree. qui a confere le grade. Some pages may have indistinct La qualite d'impression de print especially if the original certaines pages peut laisser a pages were typed with a poor desirer, surtout si les pages rypewriter ribbon or if the originales ont €96 university sent us an inferior dactylographiees a I'aide d'un photocopy. ruban 2s; ou si I'universite nous a fait parvenir une photocopie de ... ~ qualite inferieure. Reprodlrction in full or in part of La reproduction, m6me partielle, this microform is governed by de ce??emicroforme es? soumise the Canadian Copyright Act, & la Loi canadienne sur le droit R.S.C. 1970, c. C-30, and d'a~teur,SRC 1970, c. C-30, et subsequent amendments. ses amendements subsequents. The Block-Intersection Graph of Pairwise Balanced Designs Donovan Ross Hare B. Sr. (Hr,nours), University of Victoria, 1986 31. Sr... University of Alberta; 1987 a. THESIS SUBMITTED IX PARTIAL FULFILLMEYT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY in the Department of llathernatics and Statistics @Donowin Ross Hare i991 SIXON FRASER UNIVERSITY July 139i -&I1 rights reserved. ?'his work may not be rcyrociuced in whole or in part, by photocopy or other Incam, wit hc *I;: permission of the author. The author has granted an L'auteur a accorde une licence irrevocable non-exclusive licence irrevocable et non exclusive allowing the National Library of permettant a la Bibliothkque Canada to reproduce, loan, nationale du Canada de distribute or sell copies of reproduire, priiter, distribuer ou his/her thesis by any means and vendre des copies de sa these in any form or format, making de quelque maniere et sous this thesis available to interested quelque forme que ce soit pour persons. mettre des exernplaires de cette these a la disposition des personnes interessees. The author retains ownership of L'auteur conserve la proprikti. du the copyright in his/her thesis. droit d'auteur qui protege sa Neither the thesis nor substantial these. Ni la these ni des extraits extracts from it may be printed or substantiels de celie-ci ne otherwise reproduced without doivent gtre irnprimes ou his/her permission. autrement reproduits sans son autorisation. ISBN a-315-79174-2 APPROVAL Name: Donovan Ross Hare Degree: Doctor of Philosophy Title of Thesis: The Block-Intersection Graph of Pairwise Balanced Designs Examining Committee: Chairman: Dr. Alistair Lachlan -- - -, - fl .- ~r.~Brian Alspac h, Professor Senior Supervisor Dr. Tom Brown, Professor - -7- LZ/,Y -, Dr. Alan Mekler, ?rofes&r Dr. Heinz Ang, $@essy Technical University, Berlin Dr. Chris Rodger, ~rbfessor Auburn ~nive&ty External ~xarniner . Date Approved: July 29. 1991 PARTIAL CC)fJ'r'lZIGIIT C ICI.NSI: . I hereby grant- to Sitriotl FI-asc.1- ilnivcr-s i t y tfji, r i\:jlii to /crlcf my thesis, project or extended essay (the til la of which is shown boiow) to users of tho Simon Frasor Univcrsi ty Library, and to makc pal-1 ijI or single copies only for such users or in response lo a roqucst from tile l i brary of any other un ivcrs i ty , or at her educat iona I i ns-f i .t u t- i ort, on 'iSs own behalf or for om of its users. I furthcr agroc tlmf permission for multiple copying of this work for scholarly purposes may bc granted by me or the Dean of Graduate Studies. It is undcrst-ood that copy i INJ or publication of this work for financial gain shall not bc allowcd without my written permission. - Title of Thesis/Project/Extended Essay . Author: / (s ignaturef Abstract. The focws of this thesis is to investigate certain graph theoretic proper- tir-s of a class of graphs \shicL arise from combinatorial design theory. The Itlock-i~~tc.rscc.tiongraph of a pairwise balanced design has as its vertices tlw Mocks of tllc (hasign ;irici has as its edges precisely those pairs of blocks wliicll llrtvr. nori-cm~ptyilitc~rsc~c'ticm. These graphs have a particular local strllrt~xrc~which is ~sploit(~1i:i tlw proofs of the results. In Chapter 1 an ovc-rvicw is given. Defi~iitioxls,ill1 esarnple. and some motivational material (a 1,ric.f history, conrlc~.tior~sto otlicr work) are included here. Cycles of ttwse graphs are investigittctl in Chapter 2. In particular, it is shown that thiw graphs are harrli1toni;m. 111 C'llal>ter 3 the connectivity of the block- interscdon RS~LI)~is d~tel-mili(d for balanced incomplete block designs and for 'large' pairwise I>al:trtct.tf designs. Chapter 4 contains the proofs of a nri~xh~rof restilts wllich pt3rtairl to coloring the block-intersection graph. hforc specifically, it is shown that the ~~eighborhoodof a vertex of the block- intc~rsc~ctio~igraph of .large' balanced incomplete block designs can always I>ccoiortd in an optinial \say. I wish to thark my supervisor Professor Brian Alspach for his guidance and support. He and Professor Katherine Heinrich helped expose me to the gw>graphicaland sociologicd aspccts of the world of combinatorial math- cntatics (not to mention the theoretical aspects as well). I also wish to thank Dr. William McCuaig for the discussions that led to the joint work of Chapter 3. For the extra work that was created by being in other departments dur- ing the researcll of the thesis I wish to thank the Graduate Secretary, Mrs. Sylvia Holmes. I dso wish to tha~lkthe Department of Mathematics and Statistics, University of Victoria, for their hospitality during the prepara- tion of the thesis. In particular, my appreciation is extended to Dr. Chris Bose for letting me use his KeXT computer to draw the figures. Finally, I wish to thank the B. C. Science Council, the Faculty of Grad- uate Studies, the Department of Xiathe~naticsand Statist.ics, and Professor Brian Alspach for their financial support. Contents 1 Introduction 1.1 Definitions ............................ 1.1.1 Block Designs ...................... 1.1.2 Hypergraphs ...................... 1.1.3 Graphs ......................... 1.2 Basic Properties of t lrc: Block-111t.c.rsc.c.tio11 Graph ...... 1.3 History and Results of the Tfwsis ............... 1.3.1 Cycles .......................... 1.3.2 Connectivity ...................... 1.3.3 Coloring ......................... 1.4 Other Needed Results ..................... 2 Cycles 2.1 Blocks of Cardinality Two Only ................ 2.2 Blocks of Differing Cardinalities ................ 2.3 Conclusion ........................... 3 Connectivity 41 3.1 Balanced Incorriplcte Block Designs ............. 41 3.2 Pairwise Balanced Designs ................... 46 4 Coloring 53 4 .I Erdos-Faher-LovAsz Conjecture ................ 53 4.1.1 The Dual of ;I Liricar Hypergraph .......... 55 4.1.2 The Proof of the Equivalence ............. 55 4.1.3 Pairwise Balancd Designs ............... 58 4.2 Balanced Incomplete B!ock Designs .............. 58 4.2.1 IC3-factors ........................ 59 4.2.2 I<[-factors ........................ 64 4.2.3 Coloring thc Ncighhorllood of a Block ........ 66 References 68 List of Figures 1.1 The block-intersection gr;tpf~of ;L (9.3. 1).tliGgn ....... G 1.2 The structurc of a ~lc.i~l~Lorhir,c1 ill B(L3) ........... 8 2.1 Proposition 2.2 gu;ir;mtc~~stliv c~sistcwwof a p-piitll ill 11 . 21 2.2 Case3whenr>l........................ 28 2.3 C~3(bj............................. 29 2.4 Case 3(c)............................. 30 2.5 Case 3(d)............................. 31 2.6 Case 3(e)............................. 33 4.1 The structure of the graph H = (2.C) ............ 61 4.2 Counter-example for t = 5 ................... 64 ... Vlll Chapter 1 Introduction This tl~esisinvestigates a ccr-tail1 class of graphs which arise from combina- torial design theory. We prescwt in this chapter the background material for the problems being studied. The first see tion gives t hc necessary definitions as well as an example of a block-i~ltersectiongraph. Some of the basic prop- erties of the block-intersection graph are discussed in the following section. A brief history is given in the third section of the three particular areas of the block-intersection graph investigated in the subsequent chapters. The contributions the thesis makes to these areas are stated in this section as well. The final section presents a couple of results about matchings that will be used in later the remaining chapters. 1.I Definitions In this section we give definitions of the less familiar combinatorid objects and properties. For the basic graph tlleoretic terminology the reader is refe: .ed to 151. We will start wit11 designs, followed by liypc3rgr;tphs ZUNI then Dove to some non-standard graph theory dcfini tions. Some dcfirii t ions will be given in the other chapters, however, they have been invc~itcdto facilitate the reading of the proofs and so are not included h8re. 1.1.1 Block Designs Let K be a finite set of positive inregers, and let X and '1) be positivc integers such that v > max I< (here niax I< is the maxi~numclemcnt in I<; similarily for minh'). A pairwzse balanced design, denoted PBD(w,K, A), is a pair (V,D) where I/' is a finite set clenlents are called points, B is a collection of subsets of V,called block^, such that IVI = v, the blocks have their cardinalities from Ir' and any pair of distinct points is contained in exactly X blocks.
Load more

Recommended publications
  • Mutant Knots and Intersection Graphs 1 Introduction
    Mutant knots and intersection graphs S. V. CHMUTOV S. K. LANDO We prove that if a finite order knot invariant does not distinguish mutant knots, then the corresponding weight system depends on the intersection graph of a chord diagram rather than on the diagram itself. Conversely, if we have a weight system depending only on the intersection graphs of chord diagrams, then the composition of such a weight system with the Kontsevich invariant determines a knot invariant that does not distinguish mutant knots. Thus, an equivalence between finite order invariants not distinguishing mutants and weight systems depending on intersections graphs only is established. We discuss relationship between our results and certain Lie algebra weight systems. 57M15; 57M25 1 Introduction Below, we use standard notions of the theory of finite order, or Vassiliev, invariants of knots in 3-space; their definitions can be found, for example, in [6] or [14], and we recall them briefly in Section 2. All knots are assumed to be oriented. Two knots are said to be mutant if they differ by a rotation of a tangle with four endpoints about either a vertical axis, or a horizontal axis, or an axis perpendicular to the paper. If necessary, the orientation inside the tangle may be replaced by the opposite one. Here is a famous example of mutant knots, the Conway (11n34) knot C of genus 3, and Kinoshita–Terasaka (11n42) knot KT of genus 2 (see [1]). C = KT = Note that the change of the orientation of a knot can be achieved by a mutation in the complement to a trivial tangle.
    [Show full text]
  • Representations of Edge Intersection Graphs of Paths in a Tree Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
    Representations of Edge Intersection Graphs of Paths in a Tree Martin Charles Golumbic, Marina Lipshteyn, Michal Stern To cite this version: Martin Charles Golumbic, Marina Lipshteyn, Michal Stern. Representations of Edge Intersection Graphs of Paths in a Tree. 2005 European Conference on Combinatorics, Graph Theory and Appli- cations (EuroComb ’05), 2005, Berlin, Germany. pp.87-92. hal-01184396 HAL Id: hal-01184396 https://hal.inria.fr/hal-01184396 Submitted on 14 Aug 2015 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. EuroComb 2005 DMTCS proc. AE, 2005, 87–92 Representations of Edge Intersection Graphs of Paths in a Tree Martin Charles Golumbic1,† Marina Lipshteyn1 and Michal Stern1 1Caesarea Rothschild Institute, University of Haifa, Haifa, Israel Let P be a collection of nontrivial simple paths in a tree T . The edge intersection graph of P, denoted by EP T (P), has vertex set that corresponds to the members of P, and two vertices are joined by an edge if the corresponding members of P share a common edge in T . An undirected graph G is called an edge intersection graph of paths in a tree, if G = EP T (P) for some P and T .
    [Show full text]
  • NP-Complete and Cliques
    CSC373— Algorithm Design, Analysis, and Complexity — Spring 2018 Tutorial Exercise 10: Cliques and Intersection Graphs for Intervals 1. Clique. Given an undirected graph G = (V,E) a clique (pronounced “cleek” in Canadian, heh?) is a subset of vertices K ⊆ V such that, for every pair of distinct vertices u,v ∈ K, the edge (u,v) is in E. See Clique, Graph Theory, Wikipedia. A second concept that will be useful is the notion of a complement graph Gc. We say Gc is the complement (graph) of G = (V,E) iff Gc = (V,Ec), where Ec = {(u,v) | u,v ∈ V,u 6= v, and (u,v) ∈/ E} (see Complement Graph, Wikipedia). That is, the complement graph Gc is the graph over the same set of vertices, but it contains all (and only) the edges that are not in E. Finally, a clique K ⊂ V of G =(V,E) is said to be a maximal clique iff there is no superset W such that K ⊂ W ⊆ V and W is a clique of G. Consider the decision problem: Clique: Given an undirected graph and an integer k, does there exist a clique K of G with |K|≥ k? Clearly, Clique is in NP. We wish to show that Clique is NP-complete. To do this, it is convenient to first note that the independent set problem IndepSet(G, k) is very closely related to the Clique problem for the complement graph, i.e., Clique(Gc,k). Use this strategy to show: IndepSet ≡p Clique. (1) 2. Consider the interval scheduling problem we started this course with (which is also revisited in Assignment 3, Question 1).
    [Show full text]
  • On Intersection Graphs of Graphs and Hypergraphs: a Survey
    Intersection Graphs of Graphs and Hypergraphs: A Survey Ranjan N. Naika aDepartment of Mathematics, Lincoln University, PA, USA [email protected] Abstract The survey is devoted to the developmental milestones on the characterizations of intersection graphs of graphs and hypergraphs. The theory of intersection graphs of graphs and hypergraphs has been a classical topic in the theory of special graphs. To conclude, at the end, we have listed some open problems posed by various authors whose work has contributed to this survey and also the new trends coming out of intersection graphs of hyeprgraphs. Keywords: Hypergraphs, Intersection graphs, Line graphs, Representative graphs, Derived graphs, Algorithms (ALG),, Forbidden induced subgraphs (FIS), Krausz partitions, Eigen values Mathematics Subject Classification : 06C62, 05C65, 05C75, 05C85, 05C69 1. Introduction We follow the terminology of Berge, C. [3] and [4]. This survey does not address intersection graphs of other types of graphs such as interval graphs etc. An introduction of intersection graphs of interval graphs etc. are available in Pal [40]. A graph or a hypergraph is a pair (V, E), where V is the vertex set and E is the edge set a family of nonempty subsets of V. Two edges of a hypergraph are l -intersecting if they share at least l common vertices. This concept was studied in [6] and [18] by Bermond, Heydemann and Sotteau. A hypergraph H is called a k-uniform hypergraph if its edges have k number of vertices. A hypergraph is linear if any two edges have at most one common vertex. A 2-uniform linear hypergraph is called a graph or a linear graph.
    [Show full text]
  • An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
    An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling Sujoy Bhore Algorithms and Complexity Group, TU Wien, Austria [email protected] Guangping Li Algorithms and Complexity Group, TU Wien, Austria [email protected] Martin Nöllenburg Algorithms and Complexity Group, TU Wien, Austria [email protected] Abstract Map labeling is a classical problem in cartography and geographic information systems (GIS) that asks to place labels for area, line, and point features, with the goal to select and place the maximum number of independent, i.e., overlap-free, labels. A practically interesting case is point labeling with axis-parallel rectangular labels of common size. In a fully dynamic setting, at each time step, either a new label appears or an existing label disappears. Then, the challenge is to maintain a maximum cardinality subset of pairwise independent labels with sub-linear update time. Motivated by this, we study the maximal independent set (MIS) and maximum independent set (Max-IS) problems on fully dynamic (insertion/deletion model) sets of axis-parallel rectangles of two types – (i) uniform height and width and (ii) uniform height and arbitrary width; both settings can be modeled as rectangle intersection graphs. We present the first deterministic algorithm for maintaining a MIS (and thus a 4-approximate Max-IS) of a dynamic set of uniform rectangles with amortized sub-logarithmic update time. This breaks the natural barrier of Ω(∆) update time (where ∆ is the maximum degree in the graph) for vertex updates presented by Assadi et al. (STOC 2018). We continue by investigating Max-IS and provide a series of deterministic dynamic approximation schemes.
    [Show full text]
  • Treewidth and Pathwidth of Permutation Graphs
    Treewidth and pathwidth of permutation graphs Citation for published version (APA): Bodlaender, H. L., Kloks, A. J. J., & Kratsch, D. (1992). Treewidth and pathwidth of permutation graphs. (Universiteit Utrecht. UU-CS, Department of Computer Science; Vol. 9230). Utrecht University. Document status and date: Published: 01/01/1992 Document Version: Publisher’s PDF, also known as Version of Record (includes final page, issue and volume numbers) Please check the document version of this publication: • A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.
    [Show full text]
  • Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid⋆
    Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid⋆ Steven Chaplick1, Elad Cohen2, and Juraj Stacho2 1 Department of Computer Science, University of Toronto, 10 Kings College Road, Toronto, Ontario M5S 3G4, Canada, ([email protected]) 2 Caesarea Rothschild Institute, University of Haifa, Mt. Carmel, Haifa, Israel 31905 ([email protected] and [email protected]) Abstract. We investigate graphs that can be represented as vertex in- tersections of horizontal and vertical paths in a grid, known as B0-VPG graphs. Recognizing these graphs is an NP-hard problem. In light of this, we focus on their subclasses. In the paper, we describe polynomial time algorithms for recognizing chordal B0-VPG graphs, and for recognizing B0-VPG graphs that have a representation on a grid with 2 rows. 1 Introduction A VPG representation† of a graph G is a collection of paths of the two-dimensional grid where the paths represent the vertices of G in such a way that two vertices of G are adjacent if and only if the corresponding paths share at least one vertex. We focus on a special subclass of VPG representations. A B0-VPG representation of G is a VPG representation in which all paths in the collection have no bends. In other words, it is a representation of G by the intersections of orthogonal segments of the plane. Here, we emphasize the grid-based definition in order to focus on some properties of the underlying grid (e.g. size). A graph is a B0-VPG graph if it has a B0-VPG representation.
    [Show full text]
  • Coloring K K-Free Intersection Graphs of Geometric Objects in the Plane
    Coloring Kk-free intersection graphs of geometric objects in the plane ¤ y Jacob Fox János Pach Department of Mathematics Dept. Computer Science Princeton University City College of New York Princeton, NJ 08544, USA New York, NY 10031, USA [email protected] [email protected] ABSTRACT size of the largest clique, and the chromatic number Â(G) The intersection graph of a collection C of sets is a graph of G is the minimum number of colors needed to properly color the vertices of G. To compute or to approximate these on the vertex set C, in which C1;C2 2 C are joined by an parameters is a notoriously di±cult problem [18, 35, 23]. In edge if and only if C1 \ C2 6= ;. Erd}os conjectured that the chromatic number of triangle-free intersection graphs of n this paper, we study some geometric versions of the question. segments in the plane is bounded from above by a constant. The intersection graph G(C) of a family C of sets has ver- Here we show that it is bounded by a polylogarithmic func- tex set C and two sets in C are adjacent if they have non- tion of n, which is the ¯rst nontrivial bound for this problem. empty intersection. The independence number of an inter- More generally, we prove that for any t and k, the chromatic section graph G(C) is often referred to in the literature as the packing number of C. It is well known that the problem number of every Kk-free intersection graph of n curves in the plane, every pair of which have at most t points in common, of computing this parameter, even for intersection graphs of log n c log k families of very simple geometric objects such as unit disks is at most (ct ) , where c is an absolute constant log k or axis-aligned unit squares, is NP-hard [17, 25].
    [Show full text]
  • Coloring Curves That Cross a Fixed Curve
    Discrete & Computational Geometry https://doi.org/10.1007/s00454-018-0031-z Coloring Curves that Cross a Fixed Curve Alexandre Rok1 · Bartosz Walczak2 Received: 4 October 2017 / Revised: 29 August 2018 / Accepted: 2 September 2018 © The Author(s) 2018 Abstract We prove that for every integer t 1, the class of intersection graphs of curves in the plane each of which crosses a fixed curve in at least one and at most t points is χ-bounded. This is essentially the strongest χ-boundedness result one can get for those kind of graph classes. As a corollary, we prove that for any fixed integers k 2 and t 1, every k-quasi-planar topological graph on n vertices with any two edges crossing at most t times has O(n log n) edges. Keywords String graphs · χ-Boundedness · k-Quasi-planar graphs Mathematics Subject Classification 05C62 · 05C15 1 Introduction Overview A curve is a homeomorphic image of the real interval [0, 1] in the plane. The inter- section graph of a family of curves has these curves as vertices and the intersecting Editor in Charge: Kenneth Clarkson Alexandre Rok was partially supported by the Israel Science Foundation Grant 1136/12. Bartosz Walczak was partially supported by the National Science Center of Poland Grant 2015/17/D/ST1/00585. A preliminary version of this paper appeared in: Aronov, B., Katz, M.J. (eds.) 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz Int. Proc. Inform. (LIPIcs), vol. 77, no. 56, pp. 1–15. Leibniz-Zentrum für Informatik, Dagstuhl (2017). Alexandre Rok [email protected] Bartosz Walczak [email protected] 1 Department of Mathematics, Ben-Gurion University of the Negev, 84105 Be’er Sheva, Israel 2 Department of Theoretical Computer Science, Faculty of Mathematics and Computer Science, Jagiellonian University, Kraków, Poland 123 Discrete & Computational Geometry pairs of curves as edges.
    [Show full text]
  • Geometric Intersection Patterns and the Theory of Topological Graphs
    Geometric Intersection Patterns and the Theory of Topological Graphs J´anosPach∗ Abstract. The intersection graph of a set system S is a graph on the vertex set S, in which two vertices are connected by an edge if and only if the corresponding sets have nonempty intersection. It was shown by Tietze (1905) that every finite graph is the intersection graph of 3-dimensional convex polytopes. The analogous statement is false in any fixed dimension if the polytopes are allowed to have only a bounded number of faces or are replaced by simple geometric objects that can be described in terms of a bounded number of real parameters. Intersection graphs of various classes of geometric objects, even in the plane, have interesting structural and extremal properties. We survey problems and results on geometric intersection graphs and, more gener- ally, intersection patterns. Many of the questions discussed were originally raised by Berge, Erd}os,Gr¨unbaum, Hadwiger, Tur´an,and others in the context of classical topol- ogy, graph theory, and combinatorics (related, e.g., to Helly's theorem, Ramsey theory, perfect graphs). The rapid development of computational geometry and graph drawing algorithms in the last couple of decades gave further impetus to research in this field. A topological graph is a graph drawn in the plane so that its vertices are represented by points and its edges by possibly intersecting simple continuous curves connecting the corresponding point pairs. We give applications of the results concerning intersection patterns in the theory of topological graphs. Mathematics Subject Classification (2010). Primary 05C35; Secondary 05C62, 52C10.
    [Show full text]
  • Graph Theory
    Graph Theory Perfect Graphs PLANARITY 2 PERFECT GRAPHS Perfect Graphs • A perfect graph is a graph in which the chromatic number of every induced subgraph equals the size of the largest clique of that subgraph (clique number). • An arbitrary graph 퐺 is perfect if and only if we have: ∀ 푆 ⊆ 푉 퐺 휒 퐺 푆 = 휔 퐺 푆 • Theorem 1 (Perfect Graph Theorem) A graph 퐺 is perfect if and only if its complement 퐺 is perfect • Theorem 2 (Strong Perfect Graph Theorem) Perfect graphs are the same as Berge graphs, which are graphs 퐺 where neither 퐺 nor 퐺 contain an induced cycle of odd length 5 or more. 3 PERFECT GRAPHS Perfect Graphs Perfect Comparability Chordal Bipartite Permutation Split Interval Chordal Cograph Bipartite Convex Quasi- Bipartite Thresshold Biconvex Thresshold Bipartite Bipartite 4 Permutation PERFECT GRAPHS Intersection Graphs • Let 퐹 be a family of nonempty sets. The intersection graph of 퐹 is obtained be representing each set in 퐹 by a vertex: 푥 → 푦 ⇔ 푆푋∩푆푌 ≠ ∅ • The intersection graph of a family of intervals on a linearly ordered set (like the real line) is called an Interval graph. • An induced subgraph of an interval graph is an interval graph. 5 PERFECT GRAPHS Intersection Graphs • Let 퐹 be a family of nonempty sets. The intersection graph of 퐹 is obtained be representing each set in 퐹 by a vertex: 푥 → 푦 ⇔ 푆푋∩푆푌 ≠ ∅ • Circular-arc graphs properly contain the internal graphs. 6 PERFECT GRAPHS Intersection Graphs • Let 퐹 be a family of nonempty sets. The intersection graph of 퐹 is obtained be representing each set in 퐹 by a vertex: 푥 → 푦 ⇔ 푆푋∩푆푌 ≠ ∅ • A permutation diagram consists of n points on each of two parallel lines and n straight line segments matching the points.
    [Show full text]
  • Coloring Intersection Graphs of Arc-Connected Sets in the Plane
    Discrete Comput Geom (2014) 52:399–415 DOI 10.1007/s00454-014-9614-5 Coloring Intersection Graphs of Arc-Connected Sets in the Plane Michał Laso´n · Piotr Micek · Arkadiusz Pawlik · Bartosz Walczak Received: 7 February 2014 / Revised: 21 May 2014 / Accepted: 5 July 2014 / Published online: 13 August 2014 © The Author(s) 2014. This article is published with open access at Springerlink.com Abstract A family of sets in the plane is simple if the intersection of any subfamily is arc-connected, and it is pierced by a line L if the intersection of any member with L is a nonempty segment. It is proved that the intersection graphs of simple families of compact arc-connected sets in the plane pierced by a common line have chromatic number bounded by a function of their clique number. Keywords Geometric intersection graphs · Chromatic number · χ-boundedness 1 Introduction A proper coloring of a graph is an assignment of colors to the vertices of the graph such that no two adjacent ones are assigned the same color. The minimum number of colors sufficient to color a graph G properly is called the chromatic number of G and M. Laso´n · P. Micek · A. Pawlik · B. Walczak Theoretical Computer Science Department, Faculty of Mathematics and Computer Science, Jagiellonian University, Kraków, Poland e-mail: [email protected] M. Laso´n e-mail: [email protected] P. Micek e-mail: [email protected] A. Pawlik e-mail: [email protected] M. Laso´n Institute of Mathematics of the Polish Academy of Sciences, Warsaw, Poland M.
    [Show full text]