Independence numbers and chromatic numbers of some distance graphs

被引：0
|
作者：
A. V. Bobu
O. A. Kostina
A. E. Kupriyanov
机构：
[1] Lomonosov Moscow State University,Department of Mathematical Statistics and Random Processes, Faculty of Mathematics and Mechanics
来源：
Problems of Information Transmission | 2015年 / 51卷
关键词：
Information Transmission; Chromatic Number; Prime Power; Distance Graph; Intersection Theorem;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We study a family of distance graphs in ℝn. We present bounds for independence numbers which are asymptotically tight as n → ∞. We substantially improve upper bounds on chromatic numbers of these graphs, and in a number of cases we give explicit constructions of independence sets.
引用
收藏
页码：165 / 176
页数：11
相关论文
共 50 条
  • [31] Some multiple chromatic numbers of Kneser graphs
    Holroyd, Fred
    Yannakopoulos, Andonis
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2008, 64 : 23 - 32
  • [32] On chromatic Numbers of Close-to-Kneser Distance Graphs
    Bobu, A. V.
    Kupriyanov, A. E.
    PROBLEMS OF INFORMATION TRANSMISSION, 2016, 52 (04) : 373 - 390
  • [33] A NOTE ON 2-DISTANCE CHROMATIC NUMBERS OF GRAPHS
    Okamoto, Futaba
    Zhang, Ping
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2010, 7 (01) : 5 - 9
  • [34] On chromatic numbers of close-to-Kneser distance graphs
    A. V. Bobu
    A. E. Kupriyanov
    Problems of Information Transmission, 2016, 52 : 373 - 390
  • [35] Measurable chromatic and independence numbers for ergodic graphs and group actions
    Conley, Clinton T.
    Kechris, Alexander S.
    GROUPS GEOMETRY AND DYNAMICS, 2013, 7 (01) : 127 - 180
  • [36] On the Independence Numbers of Some Distance Graphs with Vertices in {–1, 0, 1}n*
    A. M. Raigorodskii
    E. D. Shishunov
    Doklady Mathematics, 2019, 99 : 165 - 166
  • [37] Graphs with tiny vector chromatic numbers and huge chromatic numbers
    Feige, U
    Langberg, M
    Schechtman, G
    FOCS 2002: 43RD ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2002, : 283 - 292
  • [38] Graphs with tiny vector chromatic numbers and huge chromatic numbers
    Feige, U
    Langberg, M
    Schechtman, G
    SIAM JOURNAL ON COMPUTING, 2004, 33 (06) : 1338 - 1368
  • [39] Circular chromatic numbers of distance graphs with distance sets missing multiples
    Huang, LL
    Chang, GJ
    EUROPEAN JOURNAL OF COMBINATORICS, 2000, 21 (02) : 241 - 248
  • [40] Independence and matching numbers of some token graphs
    de Alba, Hernan
    Carballosa, Walter
    Leanos, Jesus
    Manuel Rivera, Luis
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2020, 76 : 387 - 403
12345