A Generalization of Kneser Graphs
Matematičeskie zametki, Tome 107 (2020) no. 3, pp. 351-365
Voir la notice de l'article provenant de la source Math-Net.Ru
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.
@article{MZM_2020_107_3_a2,
author = {A. V. Bobu and A. E. Kupriyanov and A. M. Raigorodskii},
title = {A {Generalization} of {Kneser} {Graphs}},
journal = {Matemati\v{c}eskie zametki},
pages = {351--365},
publisher = {mathdoc},
volume = {107},
number = {3},
year = {2020},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_2020_107_3_a2/}
}
A. V. Bobu; A. E. Kupriyanov; A. M. Raigorodskii. A Generalization of Kneser Graphs. Matematičeskie zametki, Tome 107 (2020) no. 3, pp. 351-365. http://geodesic.mathdoc.fr/item/MZM_2020_107_3_a2/