New Construction of Graphs with High Chromatic Number and Small Clique Number

被引：0
|
作者：
Hamid Reza Daneshpajouh
机构：
[1] Institute for Research in Fundamental Sciences (IPM),School of Mathematics
[2] Moscow Institute of Physics and Technology,undefined
来源：
Discrete & Computational Geometry | 2018年 / 59卷
关键词：
Borsuk–Ulam theorem; Chromatic number; Tucker’s lemma; Triangle-free graphs; 05C15;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We introduce a new method for constructing graphs with high chromatic number and small clique number. Indeed, we present a new proof for the well-known Kneser conjecture via this method.
引用
收藏
页码：238 / 245
页数：7
相关论文
共 50 条
  • [21] The hyper-Wiener index of graphs with a given chromatic (clique) number
    Feng, Lihua
    Yu, Guihai
    Liu, Weijun
    [J]. UTILITAS MATHEMATICA, 2012, 88 : 399 - 407
  • [22] A New Spectral Bound on the Clique Number of Graphs
    Bulo, Samuel Rota
    Pelillo, Marcello
    [J]. STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, 2010, 6218 : 680 - 689
  • [23] ON GRAPHS WITH SMALL SUBGRAPHS OF LARGE CHROMATIC NUMBER
    RODL, V
    DUKE, RA
    [J]. GRAPHS AND COMBINATORICS, 1985, 1 (01) : 91 - 96
  • [24] ON COLORING GRAPHS WITH LOCALLY SMALL CHROMATIC NUMBER
    KIERSTEAD, HA
    SZEMEREDI, E
    TROTTER, WT
    [J]. COMBINATORICA, 1984, 4 (2-3) : 183 - 185
  • [25] Tight Bounds on the Clique Chromatic Number
    Joret, Gwenael
    Micek, Piotr
    Reed, Bruce
    Smid, Michiel
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2021, 28 (03):
  • [26] On the Chromatic Number of Graphs
    S. Butenko
    P. Festa
    P. M. Pardalos
    [J]. Journal of Optimization Theory and Applications, 2001, 109 (1) : 69 - 83
  • [27] On the chromatic number of graphs
    Butenko, S
    Festa, P
    Pardalos, PM
    [J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2001, 109 (01) : 51 - 67
  • [28] Fractional chromatic number and circular chromatic number for distance graphs with large clique size (vol 48, pg 329, 2005)
    Liu, DDF
    Zhu, XD
    [J]. JOURNAL OF GRAPH THEORY, 2005, 48 (04) : 329 - 330
  • [29] The rate of growth of the minimum clique size of graphs of given order and chromatic number
    Biro, Csaba
    Wease, Kris
    [J]. DISCRETE MATHEMATICS, 2015, 338 (05) : 698 - 700
  • [30] Computing clique and chromatic number of circular-perfect graphs in polynomial time
    Arnaud Pêcher
    Annegret K. Wagler
    [J]. Mathematical Programming, 2013, 141 : 121 - 133
12345