DOCSLIB.ORG

Extremal Graph Colouring and Tiling Problems

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Extremal Graph Colouring and Tiling Problems Extremal Graph Colouring and Tiling Problems Jan Corsten A thesis submitted for the degree of Doctor of Philosophy Department of Mathematics The London School of Economics and Political Science 9th July 2020 Declaration I certify that the thesis I have presented for examination for the PhD degree of the London School of Economics and Political Science is solely my own work, with the exceptions outlined below. The copyright of this thesis rests with the author. Quotation from it is permitted, provided that full acknowledgement is made. In accordance with the regulations, I have deposited an electronic copy of it in LSE Theses Online held by the British Library of Political and Economic Science and have granted permission for my thesis to be made available for public reference. Otherwise, this thesis may not be reproduced without my prior written consent. I warrant that this authorisation does not, to the best of my belief, infringe the rights of any third party. I declare that this thesis consists of 46960 words. Statement of co-authored work The contents of Chapter 2 are well-known results of various authors not including myself. I confirm that Chapter 3 contains the following joint work. Section 3.1 is based on [18], which is jointly co-authored with Sebastián Bustamante, Nóra Frankl, Alexey Pokrovskiy and Jozef Skokan. Section 3.2 is based on [31], which is jointly co-authored with Walner Mendonça. I confirm that Chapter 4 contains the following joint work. Section 4.1 is based on [30], which is jointly co-authored with Louis DeBiasio, Ander Lamaison and Richard Lang. Section 4.2 is based on [29], which is jointly co-authored with Louis DeBiasio and Paul McKenney. I confirm that Chapter 5 is based on [3], which is jointly co-authored with Peter Allen, Julia Böttcher, Ewan Davies, Matthew Jenssen, Patrick Morris, Barnaby Roberts and Jozef Skokan. 2 Abstract In this thesis, we study a variety of different extremal graph colouring and tiling problems in finite and infinite graphs. Confirming a conjecture of Gyárfás, we show that for all :,A 2 N there is a constant ¡ 0 such that the vertices of every A-edge-coloured complete :-uniform hypergraph can be partitioned into a collection of at most monochromatic tight cycles. We shall say that the family of tight cycles has finite A-colour tiling number. We further prove that, for all natural numbers :, ? and A, the family of ?-th powers of :-uniform tight cycles has finite A-colour tiling number. The case where : = 2 settles a problem of Elekes, Soukup, Soukup and Szentmiklóssy. We then show that for all natural numbers Δ,A, every family F = f1, 2,...g of graphs with E¹=º = = and Δ¹=º ≤ Δ for every = 2 N has finite A-colour tiling number. This makes progress on a conjecture of Grinshpun and Sárközy. We study Ramsey problems for infinite graphs and prove that in every 2-edge- colouring of , the countably infinite complete graph, there exists a monochromatic N p infinite path % such that + ¹%º has upper density at least ¹12 ¸ 8º/17 ≈ 0.87226 and further show that this is best possible. This settles a problem of Erdős and Galvin. We study similar problems for many other graphs including trees and graphs of bounded degree or degeneracy and prove analogues of many results concerning graphs with linear Ramsey number in finite Ramsey theory. We also study a different sort of tiling problem which combines classical problems from extremal and probabilistic graph theory, the Corrádi–Hajnal theorem and (a special case of) the Johansson–Kahn–Vu theorem. We prove that there is some constant ¡ 0 such that the following is true for every = 2 3N and every ? ≥ =−2/3¹log =º1/3. If is a graph on = vertices with minimum degree at least 2=/3, then ? (the random subgraph of obtained by keeping every edge independently with probability ?) contains a triangle tiling with high probability. 3 Acknowledgements Firstly, I would like to thank my supervisors Peter and Julia, and Jozef, who acted like a third supervisor. I would like to express my gratitude for their guidance throughout my PhD, for all the discussions (mathematical and non-mathematical), and for encouraging me to participate in workshops, conferences and summer schools around the world. I would like to thank my fellow PhD students and good friends Attila and Nóra for our collaboration and for their unlimited supply of fun puzzles. I would like also like to thank all other PhD students for making the PhD office a great work environment, and for all the fun times we had at LSE and around the world. I would like to thank Kate, Enfale, Becca, Sarah and Ed for their administrative support and creating such a nice atmosphere in the department. I would like to thank Jozef and Jan for keeping us well hydrated. Finally, I would like to thank my parents and my sister for their constant support throughout my life. 4 Contents 1 Introduction 8 1.1 Notation ................................ 10 1.1.1 Elementary Notation ..................... 10 1.1.2 O-Notation .......................... 11 1.1.3 Graphs ............................ 12 1.1.4 Hypergraphs ......................... 14 1.1.5 Edge Colourings and Ramsey Numbers ........... 17 1.1.6 Infinite Graph Theory .................... 17 1.1.7 Random Graphs ....................... 18 1.2 Graphs with Linear Ramsey Number ................. 20 1.2.1 Paths and Cycles ....................... 21 1.2.2 Trees ............................. 22 1.2.3 Graphs with Bounded Degree ................ 22 1.3 Monochromatic Graph Tiling Problems ............... 24 1.3.1 History ............................ 24 1.3.2 New Results ......................... 25 1.4 Ramsey Problems for Infinite Graphs ................. 31 1.4.1 Infinite Paths ......................... 31 1.4.2 Infinite Trees ......................... 33 1.4.3 Infinite Graphs with “Linear Ramsey Number” ....... 34 1.5 Robust Triangle Tilings in Random Graphs ............. 38 1.5.1 Shamir’s Problem ....................... 38 1.5.2 Robustness .......................... 39 Contents 2 Preliminaries 42 2.1 The Absorption Method ........................ 42 2.2 Graph Regularity ........................... 44 2.2.1 Definitions and Basic Properties ............... 44 2.2.2 The Regularity Lemma .................... 49 2.2.3 Finding Large Regular Cylinders ............... 51 2.2.4 The Blow-up Lemma ..................... 53 2.3 Hypergraph Regularity ........................ 55 2.4 Probabilistic Tools .......................... 59 2.5 Entropy ................................ 60 3 Monochromatic Graph Tiling Problems 67 3.1 Tiling Coloured Hypergraphs with Tight Cycles ........... 67 3.1.1 Overview ........................... 67 3.1.2 Absorption Method for Hypergraphs ............. 68 3.1.3 Absorption Lemma ...................... 70 3.1.4 Proof of Theorem 1.3.10. ................... 75 3.2 Tiling Coloured Graphs with Graphs of Bounded Degree ...... 78 3.2.1 Overview ........................... 78 3.2.2 Tools for the Absorption Method ............... 80 3.2.3 The Absorption Lemma ................... 81 3.2.4 Proof of Theorem 1.3.16 ................... 88 3.2.5 Concluding Remarks ..................... 93 4 Ramsey Problems for Infinite Graphs 95 4.1 Ramsey Upper Density of Paths ................... 95 4.1.1 Overview ........................... 95 4.1.2 Proof of Theorem 1.4.4 .................... 96 4.1.3 Proof of Theorem 1.4.5 .................... 99 4.1.4 From Path Forests to Paths .................. 100 4.1.5 From Simple Forests to Path Forests ............. 102 4.1.6 Upper Density of Simple Forests ............... 105 4.1.7 Sequences and Oscillation .................. 110 6 Contents 4.2 Upper Density of Monochromatic Subgraphs ............ 114 4.2.1 Overview ........................... 114 4.2.2 Preliminaries ......................... 116 4.2.3 Constructions ......................... 118 4.2.4 Ultrafilters and Embedding .................. 121 4.2.5 Bipartite Ramsey Densities .................. 124 4.2.6 Trees ............................. 126 4.2.7 Graphs of Bounded Chromatic Number ........... 131 4.2.8 Graphs of Bounded Ruling Number ............. 133 5 Robust Triangle Tilings 136 5.1 Overview ............................... 136 5.1.1 Set-up ............................. 136 5.1.2 Proof Outline ......................... 139 5.2 Counting Triangles in Γ? ....................... 140 5.3 Embedding (Partial) Triangle Tilings ................. 147 5.3.1 Counting Almost Triangle Tilings .............. 147 5.3.2 Extending Almost Triangle Tilings .............. 148 5.3.3 Completing Triangle Tilings ................. 153 5.4 Proof of the Local Distribution Lemma ................ 153 5.4.1 A Simplification ....................... 153 5.4.2 Entropy lemma ........................ 155 5.4.3 Counting via Comparison .................. 165 5.5 Reducing to Regular Triples ..................... 169 5.5.1 Preparation .......................... 169 5.5.2 Reduction ........................... 179 7 1 Introduction Extremal graph theory seeks to answer questions of the following form: what is the largest or smallest value of some graph parameter among all graphs of a given class? The possibly first result in this area determines how many edges a triangle-free graph can have. Theorem 1.0.1 (Mantel [94]). Every graph with = vertices and more than =2/4 edges contains a triangle. Furthermore, the complete bipartite graph with parts of size d=/2e and b=/2c contains b=2/4c edges and is triangle-free. Another classical example of extremal graph theory is the study of Ramsey num- bers. The Ramsey number of a graph , denoted by R¹º,
Load more

Recommended publications
  • On the Metric Dimension of Imprimitive Distance-Regular Graphs
    On the metric dimension of imprimitive distance-regular graphs Robert F. Bailey Abstract. A resolving set for a graph Γ is a collection of vertices S, cho- sen so that for each vertex v, the list of distances from v to the members of S uniquely specifies v. The metric dimension of Γ is the smallest size of a resolving set for Γ. Much attention has been paid to the metric di- mension of distance-regular graphs. Work of Babai from the early 1980s yields general bounds on the metric dimension of primitive distance- regular graphs in terms of their parameters. We show how the metric dimension of an imprimitive distance-regular graph can be related to that of its halved and folded graphs, but also consider infinite families (including Taylor graphs and the incidence graphs of certain symmetric designs) where more precise results are possible. Mathematics Subject Classification (2010). Primary 05E30; Secondary 05C12. Keywords. Metric dimension; resolving set; distance-regular graph; imprimitive; halved graph; folded graph; bipartite double; Taylor graph; incidence graph. 1. Introduction Let Γ = (V; E) be a finite, undirected graph without loops or multiple edges. For u; v 2 V , the distance from u to v is the least number of edges in a path from u to v, and is denoted dΓ(u; v) (or simply d(u; v) if Γ is clear from the context). A resolving set for a graph Γ = (V; E) is a set of vertices R = fv1; : : : ; vkg such that for each vertex w 2 V , the list of distances (d(w; v1);:::; d(w; vk)) uniquely determines w.
    [Show full text]
  • Small Integral Trees
    Small integral trees A. E. Brouwer Dept. of Math., Techn. Univ. Eindhoven P.O. Box 513, 5600MB Eindhoven, Netherlands [email protected] Submitted: Dec 31, 2007; Accepted: Jan 18, 2008; Published: Jan 28, 2008 Mathematics Subject Classification: 05C05, 05C30, 05E99 Abstract We give a table with all integral trees on at most 50 vertices, and characterize integral trees with a single eigenvalue 0. 1 Integral trees A finite graph is called integral if the spectrum of its adjacency matrix has only integral eigenvalues. A tree is a connected undirected graph without cycles. In this note we give a table with all integral trees on at most 50 vertices, and a further table with all known integral trees on at most 100 vertices. (For an on-line version, possibly with updates, see [1].) In particular, we find the smallest integral trees of diameter 6, and the smallest known integral tree of diameter 8. The nicest result about integral trees is that by Watanabe [12] that says that an integral tree different from K2 does not have a complete matching. Here we give a gener- alization. All `starlike' integral trees, that is, all integral trees with at most one vertex of degree larger than 2, were given by Watanabe and Schwenk [13]. All integral trees of diameter at most 3 were given in [13, 4]. See also [10, 3]. Several people have worked on constructing integral trees with large diameter, and examples with diameters 0{8 and 10 are known, see [13, 9, 3, 8, 6, 7]. It is unknown whether integral trees can have arbitrarily large diameter.
    [Show full text]
  • Bidirected Graph from Wikipedia, the Free Encyclopedia Contents
    Bidirected graph From Wikipedia, the free encyclopedia Contents 1 Bidirected graph 1 1.1 Other meanings ............................................ 1 1.2 See also ................................................ 2 1.3 References ............................................... 2 2 Bipartite double cover 3 2.1 Construction .............................................. 3 2.2 Examples ............................................... 3 2.3 Matrix interpretation ......................................... 4 2.4 Properties ............................................... 4 2.5 Other double covers .......................................... 4 2.6 See also ................................................ 5 2.7 Notes ................................................. 5 2.8 References ............................................... 5 2.9 External links ............................................. 6 3 Complex question 7 3.1 Implication by question ........................................ 7 3.2 Complex question fallacy ....................................... 7 3.2.1 Similar questions and fallacies ................................ 8 3.3 Notes ................................................. 8 4 Directed graph 10 4.1 Basic terminology ........................................... 11 4.2 Indegree and outdegree ........................................ 11 4.3 Degree sequence ............................................ 12 4.4 Digraph connectivity .......................................... 12 4.5 Classes of digraphs .........................................
    [Show full text]
  • Péter Szilárd Metric Dimension of Distance-Regular Graphs and Finite
    Eotv¨ os¨ Lorand´ University Faculty of Science P´eterSzil´ard Metric dimension of distance-regular graphs and finite projective planes BSc Thesis Supervisor: Tam´asH´eger Research fellow MTA{ELTE Geometric and Algebraic Combinatorics Research Group Budapest, 2017 Acknowledgements I am immensely grateful to my supervisor Tam´asH´egernot only for introducing me to the topic and providing clear and always useful professional advice but also for being there to reassure and cheer me whenever I needed it the most. I am also thankful to my friends and family, who stood beside me and bore with me during the whole of this journey. i Introduction The purpose of this thesis is to introduce the notion of metric dimension and sum- marise part of the results currently known about it especially those relating to distance-regular graphs and projective planes. Also, to present a result pertaining to the metric dimension of finite projective planes, first published in a 2012 arti- cle by Tam´asH´egerand Marcella Tak´ats[19] and refined further by the present author for the purpose of this thesis. Metric dimension is a natural graph theoretic concept studied as far back as the 1950's and since then consequently by various authors. It proved to be a quite elusive topic however, as apart from a few general observations and theorems, the majority of the current results detail very special cases of graphs. This is due to the fact that the metric dimension has a strong connection to the structure of a graph and thus graphs with special constructions or generally of interesting properties prove to be more fruitful to investigate.
    [Show full text]
  • On the Cheeger Constant for Distance-Regular Graphs. Arxiv:1811.00230V2
    On the Cheeger constant for distance-regular graphs. Jack H. Koolen 1, Greg Markowsky 2 and Zhi Qiao 3 [email protected] [email protected] [email protected] 1Wen-Tsun Wu Key Laboratory of the CAS and School of Mathematical Sciences, USTC, Hefei, China 2Department of Mathematics, Monash University, Australia 3College of Mathematics and Software Science, Sichuan Normal University, China September 19, 2019 Abstract The Cheeger constant of a graph is the smallest possible ratio between the size of a subgraph and the λ1 size of its boundary. It is well known that this constant must be at least 2 , where λ1 is the smallest positive eigenvalue of the Laplacian matrix. The subject of this paper is a conjecture of the authors that for distance-regular graphs the Cheeger constant is at most λ1. In particular, we prove the conjecture for the known infinite families of distance-regular graphs, distance-regular graphs of diameter 2 (the strongly regular graphs), several classes of distance-regular graphs with diameter 3, and most distance-regular graphs with small valency. 1 Introduction The Cheeger constant hG of a graph G is a prominent measure of the connectivity of G, and is defined as arXiv:1811.00230v2 [math.CO] 18 Sep 2019 nE[S; Sc] jV (G)jo (1) h = inf jS ⊂ V (G) with jSj ≤ ; G vol(S) 2 where V (G) is the vertex set of G, vol(S) is the sum of the valencies of the vertices in S, Sc is the complement of S in V (G), jSj is the number of vertices in S, and for any sets A; B we use E[A; B] to denote the number of edges in G which connect a point in A with a point in B; to make this last definition more precise, let E(G) ⊆ V (G) × V (G) denote the edge set of G, and then E[A; B] = jf(x; y) 2 E(G) with x 2 A; y 2 Bgj; note that with this definition each edge (x; y) with x; y 2 A \ B will in essence be counted twice, and 1 c vol(S) = E[S; S] + E[S; S ].
    [Show full text]
  • Th Slovenian International Conference on Graph Theory
    Abstracts of the 9th Slovenian International Conference on Graph Theory Bled, Slovenia, June 23 – 29, 2019 9th Slovenian International Conference on Graph Theory BLED’19 Institute of Mathematics, Physics and Mechanics Abstracts of the 9th Slovenian International Conference on Graph Theory Bled, Slovenia, June 23 – 29, 2019 Institute of Mathematics, Physics and Mechanics June 2019 Abstracts of the 9th Slovenian International Conference on Graph Theory Bled, Slovenia, June 23 – 29, 2019 Editors: Sergio Cabello, Bojan Mohar Published by the Institute of Mathematics, Physics and Mechanics, IMFM Jadranska 19, 1000 Ljubljana 350 printed copies Electronically available at https://conferences.matheo.si/e/bled19 Ljubljana, June 2019 CIP - Kataložni zapis o publikaciji Narodna in univerzitetna knjižnica, Ljubljana 519.17(082) SLOVENIAN International Conference on Graph Theory (9 ; 2019 ; Bled) Abstracts of the 9th Slovenian International Conference on Graph Theory, Bled, Slovenia, June 23-29, 2019 / [editors Sergio Cabello, Bojan Mohar]. - Ljubljana : Institute of Mathematics, Physics and Mechanics, IMFM, 2019 ISBN 978-961-92681-1-7 1. Cabello, Sergio COBISS.SI-ID 300523520 Welcome We thank all of you for coming to the 9th Slovenian International Conference on Graph Theory, Bled’19, and wish you a pleasant and successful meeting in Bled. This conference has come a long way from its first meeting in Dubrovnik (now in Croatia) in 1985. The second meeting of the series Slovenian (International) Conference on Graph Theory was held at Lake Bled in 1991, following by the subsequent meetings at the same location in 1995, 1999, 2003, 2007, and 2011. In 2015 the meeting took place in Kranjska Gora.
    [Show full text]
  • Primitive Permutation Groups with Soluble Stabilizers and Applications to Graphs
    Primitive Permutation Groups with Soluble Stabilizers and Applications to Graphs Hua Zhang School of Mathematics and Statistics A thesis submitted for the degree of Doctor of Philosophy of the University of Western Australia February 2011 September 13, 2011 Dedicated to my parents ii Statement The results in this thesis are my own except where otherwise stated. iii Acknowledgements First and foremost, I would like to express my sincere gratitude to my supervi- sor, Professor Cai Heng Li, both for his constant and patient assistance and advice throughout the preparation of the thesis, for his continuous encouragement, and for all his kindly help and emotional support during my stay here in Australia. I would like to express my sincere gratitude to my supervisor, Winthrop Pro- fessor Cheryl E. Praeger. As one of the most influential mathematician in the world, she has led the research direction of many of her Ph.D students, and each of them benefits from her rich experience and vast knowledge. Her friendliness and long-term support will be most appreciated. It is a tremendous fortune to do my Ph.D under the supervision of the two leading mathematicians. I gratefully acknowledge the financial support of the Scholarships for Interna- tional Research Fees (SIRF) from the University of Western Australia. I am deeply indebted to my wife Yan Cao and my son Yucheng Zhang for their understanding, unlimited love and support. I am very grateful to Dr Jian Ping Wu, for her long-term friendship, so much help and spiritual support. I would like to thank Associated Professor Michael Giudici and Associated Pro- fessor John Bamberg for their friendship, constructive suggestions for the thesis, and the assistance of computation.
    [Show full text]
  • Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs
    Algorithmica manuscript No. (will be inserted by the editor) Hardness and structural results for half-squares of restricted tree convex bipartite graphs Hoang-Oanh Le · Van Bang Le Received: date / Accepted: date Abstract Let B = (X,Y,E) be a bipartite graph. A half-square of B has one color class of B as vertex set, say X; two vertices are adjacent whenever they have a common neighbor in Y . Every planar graph is a half-square of a planar bipartite graph, namely of its subdivision. Until recently, only half-squares of planar bipartite graphs, also known as map graphs (Chen, Grigni and Pa- padimitriou [STOC 1998, J. ACM 2002]), have been investigated, and the most discussed problem is whether it is possible to recognize these graphs faster and simpler than Thorup’s O(n120)-time algorithm (Thorup [FOCS 1998]). In this paper, we identify the first hardness case, namely that deciding if a graph is a half-square of a balanced bisplit graph is NP-complete. (Balanced bisplit graphs form a proper subclass of star convex bipartite graphs.) For classical subclasses of tree convex bipartite graphs such as biconvex, convex, and chordal bipartite graphs, we give good structural characterizations of their half-squares that imply efficient recognition algorithms. As a by-product, we obtain new characterizations of unit interval graphs, interval graphs, and of strongly chordal graphs in terms of half-squares of biconvex bipartite, convex bipartite, and of chordal bipartite graphs, respectively. Good characterizations of half-squares of star convex and star biconvex bipartite graphs are also given, giving linear-time recognition algorithms for these half-squares.
    [Show full text]
  • Arc-Transitive Bicirculants
    ARC-TRANSITIVE BICIRCULANTS ALICE DEVILLERS, MICHAEL GIUDICI, AND WEI JIN Abstract. In this paper, we characterise the family of finite arc-transitive bicirculants. We show that every finite arc-transitive bicirculant is a normal r-cover of an arc-transitive graph that lies in one of eight infinite families or is one of seven sporadic arc-transitive graphs. Moreover, each of these “basic” graphs is either an arc-transitive bicirculant or an arc-transitive circulant, and each graph in the latter case has an arc-transitive bicirculant normal r-cover for some integer r. Keywords: bicirculant, arc-transitive graph, permutation group. Math. Subj. Class.: 05E18; 20B25 1. Introduction A graph with 2n vertices is called a bicirculant if it admits an automorphism g of order n with exactly two cycles of length n. The class of bicirculants includes Cayley graphs of dihedral groups, the Generalised Petersen graphs [10], Rose-Window graphs [34] and Tabaˇcjn graphs [3]. The last three families are particularly nice as the two orbits of hgi are cycles in the graph. Arc-transitive bicirculants have been classified for small valencies, for example valency three [10, 26, 28], valency four [18, 19, 20] and valency five [2, 3]. Moreover, bicirculants of valency 6 were recently investigated [15], while the automorphisms of bicirculants on 2p vertices for p a prime are well understood [25]. We call a graph with n vertices a circulant if it has an automorphism g that is an n- cycle. Let Γ be a connected arc-transitive circulant which is not a complete graph. Then Kov´acs [17] and Li [24] proved that either hgi is a normal subgroup of Aut(Γ), or Γ is the lexicographic product of an arc-transitive circulant and an empty graph, or Γ is obtained arXiv:1904.06467v1 [math.CO] 13 Apr 2019 by the lexicographic product of an arc-transitive circulant Σ and an empty graph and then removing some copies of Σ.
    [Show full text]
  • Topics in Algebraic Graph Theory
    Topics in Algebraic Graph Theory The rapidly expanding area of algebraic graph theory uses two different branches of algebra to explore various aspects of graph theory: linear algebra (for spectral theory) and group theory (for studying graph symmetry). These areas have links with other areas of mathematics, such as logic and harmonic analysis, and are increasingly being used in such areas as computer networks where symmetry is an important feature. Other books cover portions of this material, but this book is unusual in covering both of these aspects and there are no other books with such a wide scope. This book contains ten expository chapters written by acknowledged international experts in the field. Their well-written contributions have been carefully edited to enhance readability and to standardize the chapter structure, terminology and notation throughout the book. To help the reader, there is an extensive introductory chapter that covers the basic background material in graph theory, linear algebra and group theory. Each chapter concludes with an extensive list of references. LOWELL W. BEINEKE is Schrey Professor of Mathematics at Indiana University- Purdue University Fort Wayne. His graph theory interests include topological graph theory, line graphs, tournaments, decompositions and vulnerability. With Robin J. Wilson he has edited Selected Topics in Graph Theory (3 volumes), Applications of Graph Theory and Graph Connections.Heiscurrently the Editor of the College Mathematics Journal. ROBIN J. WILSON is Head of the Pure Mathematics Department at the Open University and Gresham Professor of Geometry, London. He has written and edited many books on graph theory and combinatorics and on the history of mathematics, including Introduction to Graph Theory and Four Colours Suffice.
    [Show full text]
  • Arxiv:2007.14277V2 [Math.CO] 19 Jan 2021 1 Introduction
    Density of monochromatic infinite subgraphs II Jan Corsten∗ Louis DeBiasio† Paul McKenney‡ January 21, 2021 Abstract In 1967, Gerencs´erand Gy´arf´asproved the following seminal result in graph-Ramsey theory: every 2-colored Kn contains a monochromatic path on d(2n + 1)=3e vertices, and this is best possible. In 1993, Erd}osand Galvin started the investigation of the analogous problem in countably infinite graphs. After a series of improvements, this problem was recently settled: in everyp 2-coloring of KN there is a monochromatic infinite path with upper density at least (12 + 8)=17, and there exists a 2-coloring which shows this is best possible. Since 1967, there have been hundreds of papers on finite graph-Ramsey theory with many of the most important results being motivated by a series of conjectures of Burr and Erd}os about graphs with linear Ramsey numbers. In a sense, this paper begins a systematic study of (quantitative) countably infinite graph-Ramsey theory, focusing on analogues of their conjectures. The following are some of our main results. (i) Let G be a countably infinite, (one-way) locally finite graph with chromatic number χ < 1. Every 2-colored KN contains a monochromatic copy of G with upper density 1 at least 2(χ−1) . (ii) Let G be a countrably infinite graph having the property that there exists a finite set X ⊆ V (G) such that G − X has no finite dominating set (in particular, graphs with bounded degeneracy have this property, as does the infinite random graph). Every finitely-colored KN contains a monochromatic copy of G with positive upper density.
    [Show full text]
  • Algebraic Aspects of Graph Theory
    UNIVERSITY OF PRIMORSKA FACULTY OF MATHEMATICS, NATURAL SCIENCES AND INFORMATION TECHNOLOGIES Ademir Hujdurovi´c ALGEBRAIC ASPECTS OF GRAPH THEORY PhD Thesis Koper, June 2013 UNIVERSITY OF PRIMORSKA FACULTY OF MATHEMATICS, NATURAL SCIENCES AND INFORMATION TECHNOLOGIES Ademir Hujdurovi´c ALGEBRAIC ASPECTS OF GRAPH THEORY PhD Thesis Koper, June 2013 Supervisor: Prof. Dragan Maruˇsiˇc,PhD Co-supervisor: Assist. Prof. Klavdija Kutnar, PhD Abstract ALGEBRAIC ASPECTS OF GRAPH THEORY This thesis contains number of different topics in algebraic graph theory, touching and resolving some open problems that have been a center of research interest over the last decade or so. More precisely, the following open problems are considered in this thesis: (i) Which graphs are (strongly) quasi m-Cayley graphs? (ii) Which bicirculants are arc-transitive graphs? (iii) Are there generalized Cayley graphs which are not Cayley graphs, but are vertex-transitive? (iv) Are there snarks amongst Cayley graphs. (v) Are there graphs admitting half-arc-transitive group actions with small number of alternets with respect to which they are not tightly attached? Problem (i) is solved for circulants and m 2 f2; 3; 4g. Problem (ii) is completely solved for pentavalent bicirculants. Problem (iii) is answered in the affirmative by constructing two infinite families of vertex-transitive non-Cayley generalized Cayley graphs. The graphs in the families are all bicirculants. Problem (iv) is solved for those (2; s; t)-Cayley graphs whose corresponding 2t-gonal graphs are prime-valent arc-transitive bicirculants. The main step in obtaining this solution is the proof that the chromatic number of any prime-valent arc-transitive bicirculant admitting a subgroup of automorphisms acting 1-regularly, with the exception of the complete graph K4, is at most 3.
    [Show full text]