A platform for research: civil engineering, architecture and urbanism
Independence numbers of random subgraphs of distance graphs
Independence numbers of random subgraphs of distance graphs
Independence numbers of random subgraphs of distance graphs
Pyaderkin, M. M. (author)
MATHEMATICAL NOTES -NEW YORK- C/C OF MATEMATICHESKIE ZAMETIK ; 99 ; 556-563
2016-01-01
8 pages
Article (Journal)
English
DDC:
510
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Independence numbers of random subgraphs of a distance graph
British Library Online Contents | 2016
|New lower bounds for the independence numbers of distance graphs with vertices in {−1, 0, 1} n
British Library Online Contents | 2011
|British Library Online Contents | 2014
|On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces
British Library Online Contents | 2015
|On Ramsey numbers for special complete distance graphs
British Library Online Contents | 2007
|