scientific article; zbMATH DE number 3672329
From MaRDI portal
Publication:3869375
zbMATH Open0432.05026MaRDI QIDQ3869375FDOQ3869375
Authors: Alexander Schrijver 
Publication date: 1978
Title of this publication is not available (Why is that?)
Cited In (75)
- Deformation retracts of neighborhood complexes of stable Kneser graphs
- On the multichromatic number of \(s\)-stable Kneser graphs
- Colouring quadrangulations of projective spaces
- Hajós-type constructions and neighborhood complexes
- Edge-critical subgraphs of Schrijver graphs. II: The general case
- Intersection patterns of finite sets and of convex sets
- Chromatic number of random Kneser hypergraphs
- On the chromatic number of general Kneser hypergraphs
- On random subgraphs of Kneser and Schrijver graphs
- Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\)
- The chromatic number of almost stable Kneser hypergraphs
- A local characterization of the Johnson scheme
- Combinatorial Stokes formulas via minimal resolutions
- Chromatic number via Turán number
- On coloring graphs with locally small chromatic number
- 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
- On colorings of graph powers
- The automorphism group of the \(s\)-stable Kneser graphs
- Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property
- 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
- On the neighborhood complex of \(\overrightarrow{s} \)-stable Kneser graphs
- Combinatorial Stokes formulae
- On the chromatic number of matching Kneser graphs
- Choice number of Kneser graphs
- Title not available (Why is that?)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Un problème de partition de l'ensemble des parties à trois éléments d'un ensemble fini
- A generalization of Kneser's conjecture
- Paths of homomorphisms from stable Kneser graphs
- Edge-critical subgraphs of Schrijver graphs
- Colorful subgraphs in Kneser-like graphs
- The equivariant topology of stable Kneser 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
- 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
- Multi-coloring the Mycielskian of graphs
- Topological bounds on the dimension of orthogonal representations of graphs
- Generalised Mycielski graphs and the Borsuk-Ulam theorem
- Colorings of complements of line graphs
- Local chromatic number and distinguishing the strength of topological obstructions
- Schrijver graphs and projective quadrangulations
- Non-cover generalized Mycielski, Kneser, and Schrijver graphs
- Independent sets in the union of two Hamiltonian cycles
- Random Kneser graphs and hypergraphs
- Nearly bipartite graphs with large chromatic number
- Shifts of the stable Kneser graphs and hom-idempotence
- Fair splittings by independent sets in sparse graphs
- Independence number of products of Kneser graphs
- A new coloring theorem of Kneser graphs
- Chromatic number is not tournament-local
- Title not available (Why is that?)
- Sperner's problem for \(G\)-independent families
- Fixed-Parameter Algorithms for the Kneser and Schrijver Problems
- The chromatic profile of locally colourable graphs
- A counterexample to a conjecture on the chromatic number of r $r$‐stable Kneser hypergraphs
- NP-hardness of coloring 2-colorable hypergraph with poly-logarithmically many colors
- Hadwiger's conjecture and topological bounds
- Monochromatic spanning trees and matchings in ordered complete graphs
- Local orthogonality dimension
- Circular chromatic number of induced subgraphs of Kneser graphs
- On the diameter of Schrijver graphs
- On finding constrained independent sets in cycles
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)
