Girth of sparse graphs

被引：21
|
作者：
Bollobás, B
Szemerédi, E
机构：
[1] Univ Memphis, Dept Math Sci, Memphis, TN 38152 USA
[2] Trinity Coll, Cambridge CB2 1TQ, England
[3] Rutgers State Univ, Dept Comp Sci, New Brunswick, NJ 08903 USA
来源：
JOURNAL OF GRAPH THEORY | 2002年 / 39卷 / 03期
关键词：
girth; cycle; sparse graph;
D O I：
10.1002/jgt.10023
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
For each fixed kgreater than or equal to0, we give an upper bound for the girth of a graph of order n and size n+k. This bound is likely to be essentially best possible as n --> infinity. (C) 2002 Wiley Periodicals, Inc.
引用
收藏
页码：194 / 200
页数：7
相关论文
共 50 条
  • [1] Homomorphisms from sparse graphs with large girth
    Borodin, OV
    Kim, SJ
    Kostochka, AV
    West, DB
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2004, 90 (01) : 147 - 159
  • [2] Sparse graphs of girth at least five are packable
    Goerlich, Agnieszka
    Zak, Andrzej
    [J]. DISCRETE MATHEMATICS, 2012, 312 (24) : 3606 - 3613
  • [3] Sparse sets in the complements of graphs with given girth
    Kostochka, AV
    Woodall, DR
    [J]. DISCRETE MATHEMATICS, 2001, 233 (1-3) : 163 - 174
  • [4] Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions
    Kim, Jaehoon
    Kostochka, Alexandr
    Zhu, Xuding
    [J]. JOURNAL OF GRAPH THEORY, 2016, 81 (04) : 403 - 413
  • [5] The coloring game on planar graphs with large girth, by a result on sparse cactuses
    Charpentier, Clement
    [J]. DISCRETE MATHEMATICS, 2017, 340 (05) : 1069 - 1073
  • [6] Acyclic 3-choosability of sparse graphs with girth at least 7
    Borodin, O. V.
    Chen, M.
    Ivanova, A. O.
    Raspaud, A.
    [J]. DISCRETE MATHEMATICS, 2010, 310 (17-18) : 2426 - 2434
  • [7] GIRTH IN GRAPHS
    THOMASSEN, C
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1983, 35 (02) : 129 - 141
  • [8] Distributed distance-r covering problems on sparse high-girth graphs
    Amiri, Saeed Akhoondian
    Wiederhake, Ben
    [J]. THEORETICAL COMPUTER SCIENCE, 2022, 906 : 18 - 31
  • [9] Girth of pancake graphs
    Compeau, Phillip E. C.
    [J]. DISCRETE APPLIED MATHEMATICS, 2011, 159 (15) : 1641 - 1645
  • [10] Girth and ?-choosability of graphs
    Gu, Yangyan
    Zhu, Xuding
    [J]. JOURNAL OF GRAPH THEORY, 2023, 103 (03) : 493 - 501
12345