scientific article; zbMATH DE number 3672329

Cited in

(85)

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