scientific article; zbMATH DE number 3672329

Cited in

(75)

A new coloring theorem of Kneser graphs
On the diameter of Schrijver graphs
On finding constrained independent sets in cycles
Deformation retracts of neighborhood complexes of stable Kneser graphs
Approximating the orthogonality dimension of graphs and hypergraphs
Colouring quadrangulations of projective spaces
On the multichromatic number of $s$-stable Kneser graphs
Hajós-type constructions and neighborhood complexes
scientific article; zbMATH DE number 7561683 (Why is no real title available?)
Chromatic number is not tournament-local
On the chromatic number of general Kneser hypergraphs
Edge-critical subgraphs of Schrijver graphs. II: The general case
On random subgraphs of Kneser and Schrijver graphs
Intersection patterns of finite sets and of convex sets
Chromatic number of random Kneser hypergraphs
The chromatic number of almost stable Kneser hypergraphs
Coloring the square of the Kneser graph $\mathrm{KG}(2k+1,k)$ and the Schrijver graph $\mathrm{SG}(2k+2,k)$
A local characterization of the Johnson scheme
Sperner's problem for $G$-independent families
Combinatorial Stokes formulas via minimal resolutions
On coloring graphs with locally small chromatic number
Fixed-Parameter Algorithms for the Kneser and Schrijver Problems
Chromatic number via Turán number
The chromatic profile of locally colourable graphs
Sharp bounds for the chromatic number of random Kneser graphs
Homotopy type of neighborhood complexes of Kneser graphs, $KG_{2,k}$
Extremal G-free induced subgraphs of Kneser graphs
The neighborhood complexes of almost $s$-stable Kneser graphs
On the generalized Erdős-Kneser conjecture: proofs and reductions
A counterexample to a conjecture on the chromatic number of r $r$‐stable Kneser hypergraphs
On colorings of graph powers
NP-hardness of coloring 2-colorable hypergraph with poly-logarithmically many colors
The automorphism group of the $s$-stable Kneser graphs
Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property
Hadwiger's conjecture and topological bounds
A combinatorial proof for the circular chromatic number of Kneser graphs
Circular coloring and Mycielski construction
On multichromatic numbers of widely colorable graphs
On the chromatic number of a subgraph of the Kneser graph
Combinatorial Stokes formulae
On the neighborhood complex of $\overrightarrow{s} $-stable Kneser graphs
Monochromatic spanning trees and matchings in ordered complete graphs
Choice number of Kneser graphs
On the chromatic number of matching Kneser graphs
Local orthogonality dimension
Un problème de partition de l'ensemble des parties à trois éléments d'un ensemble fini
Paths of homomorphisms from stable Kneser graphs
The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
Edge-critical subgraphs of Schrijver graphs
A generalization of Kneser's conjecture
The equivariant topology of stable Kneser graphs
Colorful subgraphs in Kneser-like graphs
On graphs with a large chromatic number that contain no small odd cycles
On topological relaxations of chromatic conjectures
Circular chromatic number of Kneser graphs
On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges
Symmetries of the stable Kneser graphs
Fair representation by independent sets
Circular chromatic number of induced subgraphs of Kneser graphs
On directed local chromatic number, shift graphs, and Borsuk-like graphs
Circular colouring and algebraic no-homomorphism theorems
Critical graphs without triangles: an optimum density construction
Topological bounds on the dimension of orthogonal representations of graphs
Multi-coloring the Mycielskian of graphs
Generalised Mycielski graphs and the Borsuk-Ulam theorem
Independent sets in the union of two Hamiltonian cycles
Random Kneser graphs and hypergraphs
Non-cover generalized Mycielski, Kneser, and Schrijver graphs
Shifts of the stable Kneser graphs and hom-idempotence
Nearly bipartite graphs with large chromatic number
Local chromatic number and distinguishing the strength of topological obstructions
Colorings of complements of line graphs
Schrijver graphs and projective quadrangulations
Fair splittings by independent sets in sparse graphs
Independence number of products of Kneser graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3869375)