A platform for research: civil engineering, architecture and urbanism
On Ramsey numbers for special complete distance graphs
On Ramsey numbers for special complete distance graphs
On Ramsey numbers for special complete distance graphs
Raigorodskii, A. M. (author)
MATHEMATICAL NOTES -NEW YORK- C/C OF MATEMATICHESKIE ZAMETIK ; 82 ; 426-429
2007-01-01
4 pages
Article (Journal)
English
DDC:
510
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Independence numbers of random subgraphs of distance graphs
British Library Online Contents | 2016
|Three New Lower Bounds of Circle vs Ramsey Numbers r(C~4,K~n~+~1) of a Complete Graph
British Library Online Contents | 2003
|On the structure of distance graphs with large chromatic numbers
British Library Online Contents | 2006
|Chromatic numbers of 3-dimensional distance graphs containing no tetrahedra
British Library Online Contents | 2007
|Lower bounds for the chromatic numbers of distance graphs with large girth
British Library Online Contents | 2017
|