New Eigenvalue Bound for the Fractional Chromatic Number

被引：0

|

作者：

Guo, Krystal ^{[1
]}

Spiro, Sam ^{[2
]}

机构：

[1] Korteweg-de Vries Institute for Mathematics, University of Amsterdam, Amsterdam, Netherlands

[2] Dept. of Mathematics, Rutgers University, Piscataway,NJ, United States

来源：

arXiv | 2022年

关键词：

Compendex;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Eigenvalues and eigenfunctions

引用

收藏

相关论文

共 50 条

[31] New upper bound for the chromatic number of a random subgraph of a distance graph
A. S. Gusev
Mathematical Notes, 2015, 97 : 326 - 332
[32] A New Upper Bound on the Chromatic Number of Graphs with No Odd Kt Minor
Norin, Sergey
Song, Zi-Xia
COMBINATORICA, 2022, 42 (01) : 137 - 149
[33] A New Upper Bound on the Chromatic Number of Graphs with No Odd Kt Minor
Sergey Norin
Zi-Xia Song
Combinatorica, 2022, 42 : 137 - 149
[34] A New Upper Bound for the Independence Number of Edge Chromatic Critical Graphs
Luo, Rong
Zhao, Yue
JOURNAL OF GRAPH THEORY, 2011, 68 (03) : 202 - 212
[35] New upper bound for the chromatic number of a random subgraph of a distance graph
Gusev, A. S.
MATHEMATICAL NOTES, 2015, 97 (3-4) : 326 - 332
[36] A lower bound for the chromatic capacity in terms of the chromatic number of a graph
Zhou, Bing
DISCRETE MATHEMATICS, 2013, 313 (20) : 2146 - 2149
[37] Fractional chromatic number and circular chromatic number for distance graphs with large clique size
Liu, DDF
Zhu, XD
JOURNAL OF GRAPH THEORY, 2004, 47 (02) : 129 - 146
[38] A bound on the chromatic number of the square of a planar graph
Molloy, M
Salavatipour, MR
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2005, 94 (02) : 189 - 213
[39] An asymptotically tight bound on the adaptable chromatic number
Molloy, Michael
Thron, Giovanna
JOURNAL OF GRAPH THEORY, 2012, 71 (03) : 331 - 351
[40] Using stable sets to bound the chromatic number
de Werra, D
Hansen, P
INFORMATION PROCESSING LETTERS, 2003, 87 (03) : 127 - 131

← 1 2 3 4 5 →