On independence numbers of distance graphs with vertices in {-1,0,1}n: Estimates, conjectures, and applications to the Nelson-Erdo{double acute}s-Hadwiger problem and the Borsuk problem

A. E. Guterman, V. K. Lyubimov, A. M. Raigorodskii, S. A. Usachev

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

The paper states and studies a problem that is closely related to the problems mentioned in the title.

Original languageEnglish
Pages (from-to)689-709
Number of pages21
JournalJournal of Mathematical Sciences
Volume165
Issue number6
DOIs
StatePublished - Mar 2010
Externally publishedYes

Bibliographical note

Funding Information:
Acknowledgments. This work was supported by the Russian Foundation for Basic Research, Grant No. 06-01-00383, by the Russian Federation President Grant MD-5414.2008.1, by Grant NSh-691.2008.1 of the Supporting Leading Russian Scientific Schools, and by a Grant of the “Dinastiya” Fund.

Funding

Acknowledgments. This work was supported by the Russian Foundation for Basic Research, Grant No. 06-01-00383, by the Russian Federation President Grant MD-5414.2008.1, by Grant NSh-691.2008.1 of the Supporting Leading Russian Scientific Schools, and by a Grant of the “Dinastiya” Fund.

FundersFunder number
Supporting Leading Russian Scientific Schools
Russian Foundation for Basic Research06-01-00383, MD-5414.2008.1, NSh-691.2008.1

    Fingerprint

    Dive into the research topics of 'On independence numbers of distance graphs with vertices in {-1,0,1}n: Estimates, conjectures, and applications to the Nelson-Erdo{double acute}s-Hadwiger problem and the Borsuk problem'. Together they form a unique fingerprint.

    Cite this