On the Ramsey numbers for complete distance graphs with vertices in {l_brace}0,1{r_brace}{sup n}

A new problem of Ramsey type is posed for complete distance graphs in R{sup n} with vertices in the Boolean cube. This problem is closely related to the classical Nelson-Erdos-Hadwiger problem on the chromatic number of a space. Several quite sharp estimates are obtained for certain numerical charac...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Sbornik. Mathematics 2009-12, Vol.200 (12)
Hauptverfasser:	Mikhailov, Kirill A, Raigorodskii, Andrei M
Format:	Artikel
Sprache:	eng
Schlagworte:	DISTANCE GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE GRAPH THEORY MATHEMATICAL METHODS AND COMPUTING MATHEMATICAL SPACE
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!