A platform for research: civil engineering, architecture and urbanism
Three New Lower Bounds of Circle vs Ramsey Numbers r(C~4,K~n~+~1) of a Complete Graph
Three New Lower Bounds of Circle vs Ramsey Numbers r(C~4,K~n~+~1) of a Complete Graph
Three New Lower Bounds of Circle vs Ramsey Numbers r(C~4,K~n~+~1) of a Complete Graph
Yang, Y. (author) / Xue, X.-q. (author) / Duan, Z.-m. (author)
2003-01-01
3 pages
Article (Journal)
Unknown
DDC:
622
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
On Ramsey numbers for special complete distance graphs
British Library Online Contents | 2007
|Upper Bounds for the Chromatic Numbers of Euclidean Spaces with Forbidden Ramsey Sets
British Library Online Contents | 2018
|Lower bounds for the chromatic numbers of distance graphs with large girth
British Library Online Contents | 2017
|New lower bounds for the independence numbers of distance graphs with vertices in {−1, 0, 1} n
British Library Online Contents | 2011
|