On chromatic numbers of nearly Kneser distance graphs (Q334403): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3464534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research Problems in Discrete Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems with geometric consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal number of edges in a uniform hypergraph with one forbidden intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3020323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lovász' theorem on the chromatic number of spheres revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complete nontrivial-intersection theorem for systems of finite sets / rank
 
Normal rank

Revision as of 20:02, 12 July 2024

scientific article
Language Label Description Also known as
English
On chromatic numbers of nearly Kneser distance graphs
scientific article

    Statements

    Identifiers