Journalartikel

On the chromatic number of two generalized Kneser graphs


AutorenlisteD'haeseleer, Jozefien; Metsch, Klaus; Werner, Daniel

Jahr der Veröffentlichung2022

ZeitschriftEuropean Journal of Combinatorics

Bandnummer101

ISSN0195-6698

eISSN1095-9971

Open Access StatusGreen

DOI Linkhttps://doi.org/10.1016/j.ejc.2021.103474

VerlagElsevier


Abstract
We determine the chromatic number of some graphs of flags in buildings of type A(4), namely of the Kneser graphs of flags of type {2, 4} in the vector spaces GF(q)(5) for q >= 3, and of the Kneser graph of flags of type {2, 3} in the vector spaces GF(q)(5) for large q. (C) 2021 Elsevier Ltd. All rights reserved.



Zitierstile

Harvard-ZitierstilD'haeseleer, J., Metsch, K. and Werner, D. (2022) On the chromatic number of two generalized Kneser graphs, European Journal of Combinatorics, 101, Article 103474. https://doi.org/10.1016/j.ejc.2021.103474

APA-ZitierstilD'haeseleer, J., Metsch, K., & Werner, D. (2022). On the chromatic number of two generalized Kneser graphs. European Journal of Combinatorics. 101, Article 103474. https://doi.org/10.1016/j.ejc.2021.103474



Schlagwörter


INTERSECTION-THEOREMS


Nachhaltigkeitsbezüge


Zuletzt aktualisiert 2025-10-06 um 11:33