首页|Edge-critical subgraphs of Schrijver graphs II: The general case
Edge-critical subgraphs of Schrijver graphs II: The general case
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
We give a simple combinatorial description of an (n - 2k + 2)-chromatic edge-critical subgraph of the Schrijver graph SG(n, k), itself an induced vertex-critical subgraph of the Kneser graph KG(n, k). This extends the main result of Kaiser and Stehlik (2020) [5] to all values of k, and sharpens the classical results of Lovasz and Schrijver from the 1970s. (c) 2021 Elsevier Inc. All rights reserved.
NSTL
Elsevier
