scientific article
From MaRDI portal
Publication:3869375
zbMath0432.05026MaRDI QIDQ3869375
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The automorphism group of the \(s\)-stable Kneser graphs ⋮ On random subgraphs of Kneser and Schrijver graphs ⋮ The chromatic profile of locally colourable graphs ⋮ Homotopy type of neighborhood complexes of Kneser graphs, \(KG_{2,k}\) ⋮ Circular colouring and algebraic no-homomorphism theorems ⋮ The neighborhood complexes of almost \(s\)-stable Kneser graphs ⋮ A combinatorial proof for the circular chromatic number of Kneser graphs ⋮ A local characterization of the Johnson scheme ⋮ Choice number of Kneser graphs ⋮ On the neighborhood complex of \(\overrightarrow{s} \)-stable Kneser graphs ⋮ Sharp bounds for the chromatic number of random Kneser graphs ⋮ Edge-critical subgraphs of Schrijver graphs. II: The general case ⋮ Chromatic number of random Kneser hypergraphs ⋮ Fair splittings by independent sets in sparse graphs ⋮ On graphs with a large chromatic number that contain no small odd cycles ⋮ 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 ⋮ Circular chromatic number of Kneser graphs ⋮ Unnamed Item ⋮ On the diameter of Schrijver graphs ⋮ On finding constrained independent sets in cycles ⋮ Fixed-Parameter Algorithms for the Kneser and Schrijver Problems ⋮ Unnamed Item ⋮ Monochromatic spanning trees and matchings in ordered complete graphs ⋮ A new coloring theorem of Kneser graphs ⋮ Sperner's Problem forG-Independent Families ⋮ Fair Representation by Independent Sets ⋮ Schrijver Graphs and Projective Quadrangulations ⋮ The equivariant topology of stable Kneser graphs ⋮ Critical graphs without triangles: an optimum density construction ⋮ Circular chromatic number of induced subgraphs of Kneser graphs ⋮ Intersection patterns of finite sets and of convex sets ⋮ On the generalized Erdős-Kneser conjecture: proofs and reductions ⋮ A generalization of Kneser's conjecture ⋮ On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges ⋮ Independence number of products of Kneser graphs ⋮ Hajós-Type Constructions and Neighborhood Complexes ⋮ Paths of homomorphisms from stable Kneser graphs ⋮ On the chromatic number of general Kneser hypergraphs ⋮ Independent sets in the union of two Hamiltonian cycles ⋮ Random Kneser graphs and hypergraphs ⋮ Multi-coloring the Mycielskian of graphs ⋮ Colorful subgraphs in Kneser-like graphs ⋮ Deformation retracts of neighborhood complexes of stable Kneser graphs ⋮ Combinatorial Stokes formulae ⋮ Non-cover generalized Mycielski, Kneser, and Schrijver graphs ⋮ Shifts of the stable Kneser graphs and hom-idempotence ⋮ Circular coloring and Mycielski construction ⋮ The chromatic number of almost stable Kneser hypergraphs ⋮ Symmetries of the stable Kneser graphs ⋮ Chromatic number via Turán number ⋮ On topological relaxations of chromatic conjectures ⋮ Unnamed Item ⋮ Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property ⋮ Local chromatic number and distinguishing the strength of topological obstructions ⋮ Extremal \(G\)-free induced subgraphs of Kneser graphs ⋮ On the chromatic number of a subgraph of the Kneser graph ⋮ On directed local chromatic number, shift graphs, and Borsuk-like graphs ⋮ 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 the Chromatic Number of Matching Kneser Graphs ⋮ On coloring graphs with locally small chromatic number ⋮ Topological bounds on the dimension of orthogonal representations of graphs ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Edge-critical subgraphs of Schrijver graphs ⋮ Un problème de partition de l'ensemble des parties à trois éléments d'un ensemble fini ⋮ Generalised Mycielski graphs and the Borsuk-Ulam theorem ⋮ On colorings of graph powers ⋮ Nearly bipartite graphs with large chromatic number ⋮ Colouring quadrangulations of projective spaces ⋮ On the Multichromatic Number of s‐Stable Kneser Graphs
