DOCSLIB.ORG

The Hub Number, Girth and Mycielski Graphs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Hub Number, Girth and Mycielski Graphs Information Processing Letters 114 (2014) 561–563 Contents lists available at ScienceDirect Information Processing Letters www.elsevier.com/locate/ipl The hub number, girth and Mycielski graphs ∗ Xiaoping Liu a,ZhilanDangb, Baoyindureng Wu b, a Foundation Department, Xinjiang Institute of Engineering, Urumqi, Xinjiang 830000, PR China b College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, PR China article info abstract Article history: In this note, we give a simpler proof of a theorem of Desormeaux et al., which states that Received 25 January 2014 for any connected graph G containing a cycle, γc (G) ≥ g(G) − 2, where γc (G) and g(G) Received in revised form 23 April 2014 are the connected domination number and the girth of G respectively. This enables us to Accepted 23 April 2014 confirm a conjecture of Walsh: for any connected nontree graph G, h(G) ≥ g(G) − 3, where Available online 9 May 2014 h(G) is the hub number of G. We also determine the connected domination number and Communicated by B. Doerr the connected hub number of Mycielski graphs. Keywords: © 2014 Elsevier B.V. All rights reserved. Combinatorial problems Connected domination number Girth Hub number Mycielski graphs 1. Introduction a dominating set D is called a connected dominating set (resp. a total dominating set)ifG[D] is connected (resp. We consider simple undirected graphs only, and refer δ(G[D]) ≥ 1). So, a graph G has a connected dominat- to [2,15] for undefined terminology and notation. Let G be ing set (resp. a total dominating set) if and only if G is a graph, and D ⊆ V (G).Theinduced subgraph G[D] of G connected (resp. G has no isolated vertices). The domina- is the graph with V (G[D]) = D, in which two vertices are tion number γ (G) of G is the minimum cardinality of a adjacent if and only if they are adjacent in G.IfG contains dominating set. Similarly, the connected domination num- acycle,thegirth g(G) of G is minimum length of a cycle ber γc(G) (resp. the total domination number γt (G))ofa in G. As usual, we denote the minimum and maximum graph G is the minimum cardinality of a connected dom- degree of G by δ(G) and (G) respectively. inating set (resp. a total dominating set) of G.So,forany ≥ Walsh [14] introduced the following graph theoretical graph G without isolated vertices γt (G) 2. For a con- ≥ = − concepts. A hub set in a graph G is a set U ⊆ V (G) such nected graph G of order n 2, if (G) n 1, then = = ≥ that any two nonadjacent vertices outside U are connected γc(G) 1 < 2 γt (G), and γc(G) γt (G) otherwise. ≤ by a path whose internal vertices lie in U .Ifahubsetin- It is easy to see that for a connected graph G, h(G) ≤ duces a connected subgraph, then it is called a connected hc(G) γc(G). Grauman et al. [6] and Johnson et al. [9] in- ≤ + hub set.Thehub number h(G) (resp. the connected hub num- dependently proved that γc(G) h(G) 1 for a connected graph G.So, ber hc(G)) is the minimum cardinality of a hub set (resp. a connected hub set) in G. ≤ AsetD ⊆ V (G) is called a dominating set of G if ev- Theorem 1.1. (See [6,9].) For any connected graph G, h(G) ≤ ≤ + ery vertex of V (G) \ D has a neighbor in D.Furthermore, hc(G) γc(G) h(G) 1. It was shown in [14] that determining a hub number * Corresponding author. or connected hub number of a general graph is NP-hard. E-mail address: [email protected] (B. Wu). So, there are some works devoted to find the hub number http://dx.doi.org/10.1016/j.ipl.2014.04.014 0020-0190/© 2014 Elsevier B.V. All rights reserved. 562 X. Liu et al. / Information Processing Letters 114 (2014) 561–563 or the connected hub number of some special families V μ(G) = X ∪ Y ∪{z} = of graphs. Hamburger et al. [8] showed that h(Lm,n) ={ } = ≤ ≤ x1, x2,...,xn, y1, y2,...,yn, z , hc(Lm,n) γc(Lm,n) for any 3 m n, where Lm,n is the grid lattice, i.e. the cartesian product of the paths Pm E μ(G) ={zy | 1 ≤ i ≤ n} i and Pn.Linetal.[11] determined the hub number of ∪ x x , x y , y x v v ∈ E(G), 1 ≤ i, j ≤ n . Sierpinski-Like´ graphs. i j i j i j i j − In Section 3, we determine the connected hub num- For a graph G,letμ0(G) = G, and μk(G) = μ(μk 1(G)) ber and the connected domination number of Mycielski k for an integer k ≥ 1. Mycielski showed that μ (K2) is graphs. Walsh [14] conjectured that h(G) ≥ g(G) − 3for k triangle-free and χ(μ (K2)) = k + 2, where χ(G) denotes any connected, nontree graph G. In the next section, we the chromatic number of a graph G. will show that the conjecture is true. An obvious inference from the definition of μ(G), the order of μ(G) is 2n + 1anddμ(G)(xi ) = 2dG (vi ), 2. Walsh’s conjecture dμ(G)(yi ) = dG (vi ) + 1, dμ(G)(z) = n + 1. So, δ(μ(G)) = δ(G) + 1. The following result is clear from the definition, We start with the following observation. so we omit its proof. For an edge of G, G/e denotes the graph obtained from G by contracting the edge e. Lemma 3.1. For a graph G, μ(G) is connected if and only if G has no isolated vertices. Lemma 2.1. For any connected graph G, the following holds: Various properties of Mycielski graphs are investigated (1) g(G) − 1 ≤ g(G/e) ≤ g(G), in the literature. Larsen et al. [10] studied the fractional (2) γ (G) − 1 ≤ γ (G/e) ≤ γ (G). c c c chromatic number of Mycielski graphs. Balakrishnan et al. [1] proved that κ(μ(G)) = min{δ(μ(G)), 2κ(G) + 1} for a Proof. Theresultsarestraightforward. 2 connected graph G, where κ(G) denotes the connectivity of G.Indeed,ifG containsanisolatedvertexvi ,thenxi Desormeaux, Haynes, Henning [4] established a lower is an isolated vertex of μ(G), and thus μ(G) is discon- bound of the connected domination number of a con- nected. If G is disconnected and has no isolated vertices, nected nontree graph in terms of its girth. Next we provide then by Lemma 3.1, μ(G) is connected, but z is a cut a simpler proof of the theorem as follows. vertex of μ(G), and hence κ(μ(G)) = 1. So, the result of Balakrishnan et al. [1] holds for any graph. Guo et al. [7] Theorem 2.2. (See Desormeaux, Haynes, Henning [4].) For any investigated super-connectivity and edge super connectiv- ≥ − connected graph G that contains a cycle, γc(G) g(G) 2. ity of the Mycielski graphs. Among other things, Fisher et al. [5] proved that for a graph G, γ (μ(G)) = γ (G) + 1. Lin Proof. Suppose that the theorem is not true, and let G et al. [12] established a similar relation for the total domi- be a counterexample with minimum order. Then γc(G) ≤ nation number of Mycielski graphs. g(G) − 3, g(G) ≥ 4 and γc(G) ≥ 2. Let S be a connected dominating set of G with |S|=γc(G). Take two adjacent Theorem 3.2. (See Lin et al. [12].) For a graph G without iso- vertices u, v from S.LetG = G/uv and S be the set ob- = + lated vertices, γt (μ(G)) γt (G) 1. tained from S by identifying u and v. It is clear that G is connected and contains cycles, and S is a connected dom- In the next theorem, we show that for a graph G with- inating set of G . By the minimality of G and Lemma 2.1, out isolated vertices, γ (μ(G)) = γ (G) + 1. Thus we find a c t wide family of graphs H with γc(H) = γt (H). |S|−1 = S ≥ γc G ≥ g G − 2 ≥ g(G) − 1 − 2, and thus |S|≥g(G) − 2, a contradiction. 2 Theorem 3.3. If G is a graph without isolated vertices, then γc(μ(G)) = γt (G) + 1. Next corollary confirms the validity of Walsh’s conjec- ture [14]. Proof. By Lemma 3.1, μ(G) is connected and hence γc(μ(G)) and γt (μ(G)) exists. Since γc(μ(G)) ≥ Corollary 2.3. For any connected, nontree graph G, h(G) ≥ γ (μ(G)) ≥ 2, every connected dominating set of μ(G) is − g(G) 3. a total dominating set of μ(G).So,γc(μ(G)) ≥ γt (μ(G)), and by Theorem 3.2, γc(μ(G)) ≥ γt (G) + 1. ≤ + Proof. By Theorems 1.1 and 2.2, h(G) ≥ γc(G)− 1 ≥ g(G)− To show γc(μ(G)) γt (G) 1, it suffices to find a con- 2 − 1 ≥ g(G) − 3. 2 nected domination set of cardinality γt (G) + 1inμ(G).Let D be a total dominating set of G with |D|=γt (G).Let ={ | ∈ } ={ | ∈ } 3. Mycielski graphs S i vi D and Y S yi vi D .Itisasimpleexer- cise to show that Y S ∪{z} is a connected dominating set Mycielski [13] used a fascinating construction to create of μ(G). 2 triangle-free graphs with large chromatic numbers.
Load more

Recommended publications
  • On the Cycle Double Cover Problem
    On The Cycle Double Cover Problem Ali Ghassâb1 Dedicated to Prof. E.S. Mahmoodian Abstract In this paper, for each graph , a free edge set is defined. To study the existence of cycle double cover, the naïve cycle double cover of have been defined and studied. In the main theorem, the paper, based on the Kuratowski minor properties, presents a condition to guarantee the existence of a naïve cycle double cover for couple . As a result, the cycle double cover conjecture has been concluded. Moreover, Goddyn’s conjecture - asserting if is a cycle in bridgeless graph , there is a cycle double cover of containing - will have been proved. 1 Ph.D. student at Sharif University of Technology e-mail: [email protected] Faculty of Math, Sharif University of Technology, Tehran, Iran 1 Cycle Double Cover: History, Trends, Advantages A cycle double cover of a graph is a collection of its cycles covering each edge of the graph exactly twice. G. Szekeres in 1973 and, independently, P. Seymour in 1979 conjectured: Conjecture (cycle double cover). Every bridgeless graph has a cycle double cover. Yielded next data are just a glimpse review of the history, trend, and advantages of the research. There are three extremely helpful references: F. Jaeger’s survey article as the oldest one, and M. Chan’s survey article as the newest one. Moreover, C.Q. Zhang’s book as a complete reference illustrating the relative problems and rather new researches on the conjecture. A number of attacks, to prove the conjecture, have been happened. Some of them have built new approaches and trends to study.
    [Show full text]
  • Large Girth Graphs with Bounded Diameter-By-Girth Ratio 3
    LARGE GIRTH GRAPHS WITH BOUNDED DIAMETER-BY-GIRTH RATIO GOULNARA ARZHANTSEVA AND ARINDAM BISWAS Abstract. We provide an explicit construction of finite 4-regular graphs (Γk)k∈N with girth Γk k → ∞ as k and diam Γ 6 D for some D > 0 and all k N. For each dimension n > 2, we find a → ∞ girth Γk ∈ pair of matrices in SLn(Z) such that (i) they generate a free subgroup, (ii) their reductions mod p generate SLn(Fp) for all sufficiently large primes p, (iii) the corresponding Cayley graphs of SLn(Fp) have girth at least cn log p for some cn > 0. Relying on growth results (with no use of expansion properties of the involved graphs), we observe that the diameter of those Cayley graphs is at most O(log p). This gives infinite sequences of finite 4-regular Cayley graphs as in the title. These are the first explicit examples in all dimensions n > 2 (all prior examples were in n = 2). Moreover, they happen to be expanders. Together with Margulis’ and Lubotzky-Phillips-Sarnak’s classical con- structions, these new graphs are the only known explicit large girth Cayley graph expanders with bounded diameter-by-girth ratio. 1. Introduction The girth of a graph is the edge-length of its shortest non-trivial cycle (it is assigned to be infinity for an acyclic graph). The diameter of a graph is the greatest edge-length distance between any pair of its vertices. We regard a graph Γ as a sequence of its connected components Γ = (Γk)k∈N each of which is endowed with the edge-length distance.
    [Show full text]
  • Girth in Graphs
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector JOURNAL OF COMBINATORIAL THEORY. Series B 35, 129-141 (1983) Girth in Graphs CARSTEN THOMASSEN Mathematical institute, The Technicai University oJ Denmark, Building 303, Lyngby DK-2800, Denmark Communicated by the Editors Received March 31, 1983 It is shown that a graph of large girth and minimum degree at least 3 share many properties with a graph of large minimum degree. For example, it has a contraction containing a large complete graph, it contains a subgraph of large cyclic vertex- connectivity (a property which guarantees, e.g., that many prescribed independent edges are in a common cycle), it contains cycles of all even lengths module a prescribed natural number, and it contains many disjoint cycles of the same length. The analogous results for graphs of large minimum degree are due to Mader (Math. Ann. 194 (1971), 295-312; Abh. Math. Sem. Univ. Hamburg 31 (1972), 86-97), Woodall (J. Combin. Theory Ser. B 22 (1977), 274-278), Bollobis (Bull. London Math. Sot. 9 (1977), 97-98) and Hlggkvist (Equicardinal disjoint cycles in sparse graphs, to appear). Also, a graph of large girth and minimum degree at least 3 has a cycle with many chords. An analogous result for graphs of chromatic number at least 4 has been announced by Voss (J. Combin. Theory Ser. B 32 (1982), 264-285). 1, INTRODUCTION Several authors have establishedthe existence of various configurations in graphs of sufficiently large connectivity (independent of the order of the graph) or, more generally, large minimum degree (see, e.g., [2, 91).
    [Show full text]
  • Computing the Girth of a Planar Graph in Linear Time∗
    Computing the Girth of a Planar Graph in Linear Time∗ Hsien-Chih Chang† Hsueh-I Lu‡ April 22, 2013 Abstract The girth of a graph is the minimum weight of all simple cycles of the graph. We study the problem of determining the girth of an n-node unweighted undirected planar graph. The first non-trivial algorithm for the problem, given by Djidjev, runs in O(n5/4 log n) time. Chalermsook, Fakcharoenphol, and Nanongkai reduced the running time to O(n log2 n). Weimann and Yuster further reduced the running time to O(n log n). In this paper, we solve the problem in O(n) time. 1 Introduction Let G be an edge-weighted simple graph, i.e., G does not contain multiple edges and self- loops. We say that G is unweighted if the weight of each edge of G is one. A cycle of G is simple if each node and each edge of G is traversed at most once in the cycle. The girth of G, denoted girth(G), is the minimum weight of all simple cycles of G. For instance, the girth of each graph in Figure 1 is four. As shown by, e.g., Bollobas´ [4], Cook [12], Chandran and Subramanian [10], Diestel [14], Erdos˝ [21], and Lovasz´ [39], girth is a fundamental combinatorial characteristic of graphs related to many other graph properties, including degree, diameter, connectivity, treewidth, and maximum genus. We address the problem of computing the girth of an n-node graph. Itai and Rodeh [28] gave the best known algorithm for the problem, running in time O(M(n) log n), where M(n) is the time for multiplying two n × n matrices [13].
    [Show full text]
  • The Line Mycielskian Graph of a Graph
    [VOLUME 6 I ISSUE 1 I JAN. – MARCH 2019] e ISSN 2348 –1269, Print ISSN 2349-5138 http://ijrar.com/ Cosmos Impact Factor 4.236 THE LINE MYCIELSKIAN GRAPH OF A GRAPH Keerthi G. Mirajkar1 & Veena N. Mathad2 1Department of Mathematics, Karnatak University's Karnatak Arts College, Dharwad - 580001, Karnataka, India 2Department of Mathematics, University of Mysore, Manasagangotri, Mysore-06, India Received: January 30, 2019 Accepted: March 08, 2019 ABSTRACT: In this paper, we introduce the concept of the line mycielskian graph of a graph. We obtain some properties of this graph. Further we characterize those graphs whose line mycielskian graph and mycielskian graph are isomorphic. Also, we establish characterization for line mycielskian graphs to be eulerian and hamiltonian. Mathematical Subject Classification: 05C45, 05C76. Key Words: Line graph, Mycielskian graph. I. Introduction By a graph G = (V,E) we mean a finite, undirected graph without loops or multiple lines. For graph theoretic terminology, we refer to Harary [3]. For a graph G, let V(G), E(G) and L(G) denote the point set, line set and line graph of G, respectively. The line degree of a line uv of a graph G is the sum of the degree of u and v. The open-neighborhoodN(u) of a point u in V(G) is the set of points adjacent to u. For each ui of G, a new point uˈi is introduced and the resulting set of points is denoted by V1(G). Mycielskian graph휇(G) of a graph G is defined as the graph having point set V(G) ∪V1(G) ∪v and line set E(G) ∪ {xyˈ : xy∈E(G)} ∪ {y ˈv : y ˈ ∈V1(G)}.
    [Show full text]
  • Lecture 13: July 18, 2013 Prof
    UChicago REU 2013 Apprentice Program Spring 2013 Lecture 13: July 18, 2013 Prof. Babai Scribe: David Kim Exercise 0.1 * If G is a regular graph of degree d and girth ≥ 5, then n ≥ d2 + 1. Definition 0.2 (Girth) The girth of a graph is the length of the shortest cycle in it. If there are no cycles, the girth is infinite. Example 0.3 The square grid has girth 4. The hexagonal grid (honeycomb) has girth 6. The pentagon has girth 5. Another graph of girth 5 is two pentagons sharing an edge. What is a very famous graph, discovered by the ancient Greeks, that has girth 5? Definition 0.4 (Platonic Solids) Convex, regular polyhedra. There are 5 Platonic solids: tetra- hedron (four faces), cube (\hexahedron" - six faces), octahedron (eight faces), dodecahedron (twelve faces), icosahedron (twenty faces). Which of these has girth 5? Can you model an octahedron out of a cube? Hint: a cube has 6 faces, 8 vertices, and 12 edges, while an octahedron has 8 faces, 6 vertices, 12 edges. Definition 0.5 (Dual Graph) The dual of a plane graph G is a graph that has vertices corre- sponding to each face of G, and an edge joining two neighboring faces for each edge in G. Check that the dual of an dodecahedron is an icosahedron, and vice versa. Definition 0.6 (Tree) A tree is a connected graph with no cycles. Girth(tree) = 1. For all other connected graphs, Girth(G) < 1. Definition 0.7 (Bipartite Graph) A graph is bipartite if it is colorable by 2 colors, or equiva- lently, if the vertices can be partitioned into two independent sets.
    [Show full text]
  • Dynamic Cage Survey
    Dynamic Cage Survey Geoffrey Exoo Department of Mathematics and Computer Science Indiana State University Terre Haute, IN 47809, U.S.A. [email protected] Robert Jajcay Department of Mathematics and Computer Science Indiana State University Terre Haute, IN 47809, U.S.A. [email protected] Department of Algebra Comenius University Bratislava, Slovakia [email protected] Submitted: May 22, 2008 Accepted: Sep 15, 2008 Version 1 published: Sep 29, 2008 (48 pages) Version 2 published: May 8, 2011 (54 pages) Version 3 published: July 26, 2013 (55 pages) Mathematics Subject Classifications: 05C35, 05C25 Abstract A(k; g)-cage is a k-regular graph of girth g of minimum order. In this survey, we present the results of over 50 years of searches for cages. We present the important theorems, list all the known cages, compile tables of current record holders, and describe in some detail most of the relevant constructions. the electronic journal of combinatorics (2013), #DS16 1 Contents 1 Origins of the Problem 3 2 Known Cages 6 2.1 Small Examples . 6 2.1.1 (3,5)-Cage: Petersen Graph . 7 2.1.2 (3,6)-Cage: Heawood Graph . 7 2.1.3 (3,7)-Cage: McGee Graph . 7 2.1.4 (3,8)-Cage: Tutte-Coxeter Graph . 8 2.1.5 (3,9)-Cages . 8 2.1.6 (3,10)-Cages . 9 2.1.7 (3,11)-Cage: Balaban Graph . 9 2.1.8 (3,12)-Cage: Benson Graph . 9 2.1.9 (4,5)-Cage: Robertson Graph . 9 2.1.10 (5,5)-Cages .
    [Show full text]
  • Properties Ii1: Girth and Circumference
    Iernat. J. Math. & Math. Si. 685 Vol. 2 No. 4 (1979) 685-692 A GRAPH AND ITS COMPLEMENT WITH SPECIFIED PROPERTIES II1: GIRTH AND CIRCUMFERENCE JIN AKIYAMA AND FRANK HARARY Department of Mathematics The University of Michigan Ann Arbor, Michigan 48109 U.S.A. (Received April 5, 1979) ABSTRACT. In this series, we investigate the conditions under which both a graph G and its complement G possess certain specified properties. We now characterize all the graphs G such that both G and G have the same girth. We also determine all G such that both G and G have circumference 3 or4. KEF WORDS AND PHRASES. Graph, Complement, Girth, bmfence. 1980 MATHEMATICS SUBJECT CLASSIFICATION CODES. 05C99. iVisiting Scholar, 1978-79, from Nippon Ika University, Kawasaki, Japan. 2Vice-President, Calcutta Mathematical Society, 1978 and 1979. 686 J. AKIYAMA AND F. HARARY I. NOTATIONS AND BACKGROUND. In the first paper [2] in this series, we found all graphs G such that both G and its complement G have (a) connectivity 1, (b) line-connectivity 1, (c) mo cycles, (d) only even cycles, and other properties. Continuing this study, we determined in [3] the graphs G for which G and 6 are (a) block-graphs, (b) middle graphs, () bivariegated, and (d) n'th subdivision graphs. Now we concentrate on the two invariants concerning cycle lengths- girth and circum- ference. We will see that whenever G and G have the same girth g then g 3 or 5 only. For the circumference c we study only the cases where both G and G have c 3 or 4 Following the notation and of the G + G of two terminology [4], join 1 2 graphs is the union of G and G with the sets 1 2 complete bigraph having point V and V We will require a related ternary operation denoted G + G + G 1 2 1 2 3 on three disjoint graphs, defined as the union of the two joins G + G and 1 2 G + G Thus, this resembles the composition of the path not with just 2 3 P3 one other graph but with three graphs, one for each point; Figure 1 illustrates the "random" graph K e K + K + K Of course the quaternary operation 4 1 2 1 G + G + G + G is defined similarly.
    [Show full text]
  • Computing the Girth of a Planar Graph in O(Nlogn) Time
    Computing the girth of a planar graph in O(n log n) time Oren Weimann and Raphael Yuster ICALP’2009 & SIAM Journal on Discrete Mathematics 24 (2010) 609–616. Speaker: Joseph, Chuang-Chieh Lin Supervisor: Professor Maw-Shang Chang Computation Theory Laboratory Department of Computer Science and Information Engineering National Chung Cheng University, Taiwan December 7, 2010 1/38 Outline 1 Introduction 2 Planar graphs and k-outerplanar graphs The face size & the girth General ideas of the O(n log n) algorithm 3 The divide-and-conquer algorithm for k-outerplanar graphs 2/38 Outline 1 Introduction 2 Planar graphs and k-outerplanar graphs The face size & the girth General ideas of the O(n log n) algorithm 3 The divide-and-conquer algorithm for k-outerplanar graphs 3/38 Girth Definition (The girth of a graph G) The length of the shortest cycle of G. The girth has tight connections to many graph properties. chromatic number; minimum or average vertex-degree; diameter; connectivity; genus; ... 4/38 Girth Definition (The girth of a graph G) The length of the shortest cycle of G. The girth has tight connections to many graph properties. chromatic number; minimum or average vertex-degree; diameter; connectivity; genus; ... 4/38 The road of computing the girth of a graph For general graphs G = (V , E), n = V and m = E : | | | | O(nm) [Itai & Rodeh, SIAM J. Comput. 1978]. O(n2) with an additive error of one. For computing the shortest even-length cycle: O(n2α(n)) [Monien, Computing 1983]. O(n2) [Yuster & Zwick, SIAM J.
    [Show full text]
  • COLORING GRAPHS with FIXED GENUS and GIRTH 1. Introduction Grötzsch
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 349, Number 11, November 1997, Pages 4555{4564 S 0002-9947(97)01926-0 COLORING GRAPHS WITH FIXED GENUS AND GIRTH JOHN GIMBEL AND CARSTEN THOMASSEN Abstract. It is well known that the maximum chromatic number of a graph 1=2 on the orientable surface Sg is θ(g ). We prove that there are positive con- stants c1;c2 such that every triangle-free graph on Sg has chromatic number 1=3 less than c2(g= log(g)) and that some triangle-free graph on Sg has chro- g1=3 matic number at least c1 log(g) . We obtain similar results for graphs with restricted clique number or girth on Sg or Nk. As an application, we prove 3=7 that an Sg-polytope has chromatic number at most O(g ). For specific sur- faces we prove that every graph on the double torus and of girth at least six is 3-colorable and we characterize completely those triangle-free projective graphs that are not 3-colorable. 1. Introduction Gr¨otzsch [14] proved that every planar graph with no triangles can be 3-colored. A short proof is given in [23]. Kronk and White [18] proved that every toroidal graph with no triangles can be 4-colored and that every toroidal graph with no cycles of length less than six can be 3-colored. Kronk [17] studied the chromatic number of triangle-free graphs on certain surfaces. Thomassen [23] showed that every graph on the torus with girth at least five is 3-colorable (as conjectured in [18]) and in the same work showed that a graph which embeds on the projective plane with no contractible 3-cycle nor 4-cycle is 3-colorable.
    [Show full text]
  • Bounds on Graphs with High Girth and High Chromatic Number
    Graph Theory Erdos˝ Results Bounds on graphs with high girth and high chromatic number Enrique Treviño joint work with Daniel Bath and Zequn Li INTEGERS 2013: The Erdos˝ Centennial Conference October 26, 2013 Enrique Treviño Bounds on graphs with high girth and high chromatic number Graph Theory Erdos˝ Results Some Definitions Chromatic Number: The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color. Cycle: A cycle graph of length n is an n sided polygon (i.e., a graph with n vertices and n edges where each vertex has degree 2). Example: Enrique Treviño Bounds on graphs with high girth and high chromatic number Graph Theory Erdos˝ Results More Definitions Independent Set: An independent set in a graph is a set of vertices no two of which are adjacent. Girth Number : The girth number of a graph is the length of a shortest cycle contained in the graph. If the graph does not contain any cycles (i.e. it’s an acyclic graph), its girth is defined to be infinity. In the following example the girth number is 8: Enrique Treviño Bounds on graphs with high girth and high chromatic number Graph Theory Erdos˝ Results Examples Figure: The maximal independent set consists of vertices f8; 1; 3; 5g, the chromatic number is at least 5 because the vertices f2; 8; 7; 4; 6g form a complete graph. The girth number is 3 because 3 is the smallest cycle. Enrique Treviño Bounds on graphs with high girth and high chromatic number Graph Theory Erdos˝ Results Erdos,˝ 1959 In the paper “Graph Theory and Probability”, Erdos˝ proved the following: Let h(k; l) be the least integer such that every graph with h(k; l) vertices contains either a cycle of k or fewer edges or the graph contains a set of l independent vertices.
    [Show full text]
  • On Approximating the D-Girth of a Graph
    On approximating the d-girth of a graph David Peleg1, Ignasi Sau2, and Mordechai Shalom3 1 Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel. [email protected] 2 AlGCo project-team, CNRS, Laboratoire d'Informatique de Robotique et de Micro¶electroniquede Montpellier (LIRMM), Montpellier, France. [email protected] 3 TelHai Academic College, Upper Galilee, 12210, Israel. [email protected] Abstract. For a ¯nite, simple, undirected graph G and an integer d ¸ 1, a mindeg-d subgraph is a subgraph of G of minimum degree at least d. The d- girth of G, denoted gd(G), is the minimum size of a mindeg-d subgraph of G. It is a natural generalization of the usual girth, which coincides with the 2-girth. The notion of d-girth was proposed by Erd}os et al. [13, 14] and Bollob¶asand Brightwell [7] over 20 years ago, and studied from a purely combinatorial point of view. Since then, no new insights have appeared in the literature. Recently, ¯rst algorithmic studies of the problem have been carried out [2,4]. The current article further explores the complexity of ¯nding a small mindeg-d subgraph of a given graph (that is, approximating its d-girth), by providing new hardness results and the ¯rst approximation algorithms in general graphs, as well as analyzing the case where G is planar. Keywords: generalized girth, minimum degree, approximation algorithm, hard- ness of approximation, randomized algorithm, planar graph. 1 Introduction Degree-constrained subgraph problems have attracted considerable attention in the last decades, resulting in a large body of literature (see e.g.
    [Show full text]