Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii (Q5396969): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Research Problems in Discrete Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mathematical Coloring Book / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5183516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borsuk's problem and the chromatic numbers of some metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Distance Graphs and Graphs of Diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4410025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of a space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The realization of distances within sets in Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems with geometric consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The problems of Borsuk and Grunbaum on lattice polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the chromatic numbers of Euclidean space by convex minimization methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3315532 / 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: On the chromatic numbers of spheres in Euclidean spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of spheres in \(\mathbb R^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance graphs with large chromatic numbers and small clique numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distance graphs with large chromatic number but without large simplices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3117615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance graphs with large chromatic number and without large cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Difference Between Consecutive Primes, II / rank
 
Normal rank

Revision as of 08:26, 7 July 2024

scientific article; zbMATH DE number 6254906
Language Label Description Also known as
English
Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii
scientific article; zbMATH DE number 6254906

    Statements

    Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii (English)
    0 references
    4 February 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    distance graph
    0 references
    chromatic number
    0 references
    number of cliques
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references