Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
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. (Autor:in) / Xue, X.-q. (Autor:in) / Duan, Z.-m. (Autor:in)
01.01.2003
3 pages
Aufsatz (Zeitschrift)
Unbekannt
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
|A refinement of Ramsey theorem
British Library Online Contents | 2002
|