AN EXTREMAL PROBLEM FOR CYCLES IN HAMILTONIAN GRAPHS

被引：9
|
作者：
HENDRY, GRT
BRANDT, S
机构：
[1] UNIV ABERDEEN,DEPT MATH SCI,ABERDEEN AB9 2TY,SCOTLAND
[2] FREE UNIV BERLIN,FB MATH,D-14195 BERLIN,GERMANY
来源：
GRAPHS AND COMBINATORICS | 1995年 / 11卷 / 03期
关键词：
D O I：
10.1007/BF01793012
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
For integers p and r with 3 less than or equal to r less than or equal to p - 1, let f(p, r) denote the maximum number of edges in a hamiltonian graph of order p which does not contain a cycle of length r. Results from literature on the determination of f(p, r) are collected and a number of new lower bounds, many of which are conjectured to be best possible, are given. The main result presented is the proof that f(p, 5) = (p - 3)(2)/4 + 5 for odd p greater than or equal to 11.
引用
收藏
页码：255 / 262
页数：8
相关论文
共 50 条
  • [1] THE ESSENTIAL SUBGRAPH WITH RESPECT TO THE HAMILTONIAN CYCLES PROBLEM - POLYNOMIAL REDUCTION OF THE HAMILTONIAN CYCLES PROBLEM TO A PARTICULAR CLASS OF GRAPHS
    MALGOUYRES, R
    [J]. COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1994, 319 (04): : 405 - 410
  • [2] On extremal hypergraphs for Hamiltonian cycles
    Glebov, Roman
    Person, Yury
    Weps, Wilma
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2012, 33 (04) : 544 - 555
  • [3] Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles
    Azarija, Jernej
    Klavzar, Sandi
    [J]. JOURNAL OF GRAPH THEORY, 2015, 80 (01) : 34 - 42
  • [4] TURANS EXTREMAL PROBLEM IN RANDOM GRAPHS - FORBIDDING EVEN CYCLES
    HAXELL, PE
    KOHAYAKAWA, Y
    LUCZAK, T
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1995, 64 (02) : 273 - 287
  • [5] HAMILTONIAN CYCLES IN GRAPHS
    LIU, ZH
    ZHU, YJ
    TIAN, F
    [J]. ANNALS OF THE NEW YORK ACADEMY OF SCIENCES, 1989, 576 : 367 - 376
  • [6] Field theoretic approach to the counting problem of Hamiltonian cycles of graphs
    Higuchi, S
    [J]. PHYSICAL REVIEW E, 1998, 58 (01): : 128 - 132
  • [7] Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult
    Korpelainen, Nicholas
    Lozin, Vadim V.
    Tiskin, Alexander
    [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2010, 6108 : 320 - 327
  • [8] HAMILTONIAN CYCLES IN STRIPED GRAPHS - THE 2-STRIPE PROBLEM
    GARFINKEL, RS
    SUNDARARAGHAVAN, PS
    [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1984, 5 (04): : 463 - 466
  • [9] Turan's extremal problem in random graphs: Forbidding odd cycles
    Haxell, PE
    Kohayakawa, Y
    Luczak, T
    [J]. COMBINATORICA, 1996, 16 (01) : 107 - 122
  • [10] On the Extremal Number of Edges in Hamiltonian Graphs
    Ho, Tung-Yang
    Lin, Cheng-Kuan
    Tan, Jimmy J. M.
    Hsu, D. Frank
    Hsu, Lih-Hsing
    [J]. JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2011, 27 (05) : 1659 - 1665
12345