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

DOI10.1016/j.jctb.2021.06.009zbMath1478.05055arXiv2007.09204OpenAlexW3186157358MaRDI QIDQ2664563

Matěj Stehlík, Tomáš Kaiser

Publication date: 17 November 2021

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.09204

zbMATH Keywords

graph colouringKneser graphedge-critical graphSchrijver graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Choice number of Kneser graphs ⋮ Sharp bounds for the chromatic number of random Kneser graphs ⋮ On the diameter of Schrijver graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• Edge-critical subgraphs of Schrijver graphs
• On constructive methods in the theory of colour-critical graphs
• On the chromatic number of a subgraph of the Kneser graph
• On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges
• Generalised Mycielski graphs and the Borsuk-Ulam theorem
• Colouring quadrangulations of projective spaces
• Schrijver Graphs and Projective Quadrangulations
• On graphs with strongly independent color-classes
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler

This page was built for publication: Edge-critical subgraphs of Schrijver graphs. II: The general case