On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem (Q2452861): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q123159679, #quickstatements; #temporary_batch_1723453003539
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Alexander E. Guterman / rank
Normal rank
 
Property / author
 
Property / author: Andrei M. Raigorodskii / rank
Normal rank
 
Property / author
 
Property / author: Alexander E. Guterman / rank
 
Normal rank
Property / author
 
Property / author: Andrei M. Raigorodskii / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10958-010-9835-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018296627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on advances in combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complete nontrivial-intersection theorem for systems of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complete intersection theorem for systems of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on asymptotic control theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excursions into combinatorial geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3602146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdös–Ko–Rado Theorem—22 Years Later / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems with geometric consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to Borsuk’s conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002287 / 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: Q3036589 / 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: On Ramsey Type Problems in Combinatorial Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4410025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Borsuk partition problem: the seventieth anniversary / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Borsuk and Erdős-Hadwiger numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lower bounds for Borsuk and Hadwiger numbers / 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: On a series of problems related to the Borsuk and Nelson-Erdős-Hadwiger problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5504816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the dimension in Borsuk's problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of Euclidean space and the Borsuk problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Illuminating sets of constant width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic numbers of metric spaces with few forbidden distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3781767 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q123159679 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:07, 12 August 2024

scientific article
Language Label Description Also known as
English
On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem
scientific article

    Statements

    On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 June 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers