New lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^{n}\) (Q650424): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q591851
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Andrei M. Raigorodskii / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / 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: Excursions into combinatorial geometry / rank
 
Normal rank

Latest revision as of 16:14, 4 July 2024

scientific article
Language Label Description Also known as
English
New lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^{n}\)
scientific article

    Statements

    New lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^{n}\) (English)
    0 references
    0 references
    0 references
    25 November 2011
    0 references
    distance graph
    0 references
    independence number
    0 references
    Borsuk problem
    0 references
    Nelson-Erdős-Hadwiger problem
    0 references

    Identifiers