Edge-critical subgraphs of Schrijver graphs II: The general case

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F22%3A43962993" target="_blank" >RIV/49777513:23520/22:43962993 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.jctb.2021.06.009" target="_blank" >https://doi.org/10.1016/j.jctb.2021.06.009</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jctb.2021.06.009" target="_blank" >10.1016/j.jctb.2021.06.009</a>

Result language
angličtina
Original language name
Edge-critical subgraphs of Schrijver graphs II: The general case
Original language description
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 Stehlík (2020) to all values of k, and sharpens the classical results of Lovász and Schrijver from the 1970s.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
<a href="/en/project/GA20-09525S" target="_blank" >GA20-09525S: Structural properties of graph classes characterized by forbidden subgraphs</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)