|
This article is cited in 13 scientific papers (total in 13 papers)
A Generalization of Kneser Graphs
A. V. Bobua, A. E. Kupriyanova, A. M. Raigorodskiibacd a Lomonosov Moscow State University
b Moscow Institute of Physics and Technology (State University), Dolgoprudny, Moscow region
c Caucasus Mathematical Center, Adyghe State University, Maikop
d Buryat State University, Institute for Mathematics and Informatics, Ulan-Ude
Abstract:
Graphs which are analogs of Kneser graphs are studied. The problem of determining the chromatic numbers of these graphs is considered. It is shown that their structure is similar to that of Kneser graphs. Upper and lower bounds for the chromatic numbers of the graphs under examination are obtained. For certain parameter values, an order-sharp estimate of the chromatic numbers is found, and in some cases, the exact value of the quantity in question is determined.
Keywords:
Kneser's conjecture, Kneser graphs, topological method.
Received: 01.10.2018 Revised: 23.05.2019
Citation:
A. V. Bobu, A. E. Kupriyanov, A. M. Raigorodskii, “A Generalization of Kneser Graphs”, Mat. Zametki, 107:3 (2020), 351–365; Math. Notes, 107:3 (2020), 392–403
Linking options:
https://www.mathnet.ru/eng/mzm12205https://doi.org/10.4213/mzm12205 https://www.mathnet.ru/eng/mzm/v107/i3/p351
|
Statistics & downloads: |
Abstract page: | 406 | Full-text PDF : | 68 | References: | 50 | First page: | 30 |
|