The odd girth of the generalised Kneser graph

被引:9
|
作者
Denley, T [1 ]
机构
[1] UNIV CAMBRIDGE,DEPT PURE MATH & MATH STAT,CAMBRIDGE CB2 1SB,ENGLAND
关键词
D O I
10.1006/eujc.1996.0122
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let X = {1, 2,..., n} be a set of n elements and let X-(r) be the collection of all the subsets of X containing precisely r elements. Then the generalised Kneser graph K(n, r, s) (when 2r - s less than or equal to n) is the graph with vertex set X-(r) and edges AB for A, B is an element of X-(r) with \A boolean AND B\ less than or equal to s. Here we show that the odd girth of the generalised Kneser graph K(n, r, s) is 2 inverted right perpendicular r-s/n-2(r-s) inverted left perpendicular +1 provided that n is large enough compared with r and s. (C) 1997 Academic Press Limited.
引用
收藏
页码:607 / 611
页数:5
相关论文
共 50 条
  • [41] Generalised acyclic edge colourings of graphs with large girth
    Gerke, Stefanie
    Raemy, Melanie
    Discrete Mathematics, 2007, 307 (13) : 1668 - 1671
  • [42] Odd Induced Subgraphs in Planar Graphs with Large Girth
    Rao, Mengjiao
    Hou, Jianfeng
    Zeng, Qinghou
    GRAPHS AND COMBINATORICS, 2022, 38 (04)
  • [43] AN INFINITE GRAPH OF GIRTH-12
    WEISS, AI
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1984, 283 (02) : 575 - 588
  • [44] Odd Induced Subgraphs in Planar Graphs with Large Girth
    Mengjiao Rao
    Jianfeng Hou
    Qinghou Zeng
    Graphs and Combinatorics, 2022, 38
  • [45] 4-Chromatic graphs with large odd girth
    Discrete Math, 1-3 (387):
  • [46] Spectral radius of graphs with given size and odd girth
    Lou, Zhenzhen
    Lu, Lu
    Huang, Xueyi
    ELECTRONIC JOURNAL OF COMBINATORICS, 2024, 31 (01):
  • [47] The average eccentricity of a graph with prescribed girth
    Osaye, F. J.
    DISCRETE MATHEMATICS, 2022, 345 (12)
  • [48] The Steiner diameter of a graph with prescribed girth
    Ali, Patrick
    DISCRETE MATHEMATICS, 2013, 313 (12) : 1322 - 1326
  • [49] A Small Trivalent Graph of Girth 14
    Exoo, Geoffrey
    ELECTRONIC JOURNAL OF COMBINATORICS, 2002, 9
  • [50] On the limit of large girth graph sequences
    Gábor Elek
    Combinatorica, 2010, 30 : 553 - 563