![]() | Up a level |
Frankl, Nóra and Kupavskii, Andrey (2020) Almost sharp bounds on the number of discrete chains in the plane. In: Cabello, Sergio and Chen, Danny Z., (eds.) 36th International Symposium on Computational Geometry, SoCG 2020. Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. ISBN 9783959771436
Frankl, Nóra, Kupavskii, Andrey and Swanepoel, Konrad ORCID: 0000-0002-1668-887X
(2020)
Embedding graphs in Euclidean space.
Journal of Combinatorial Theory, Series A, 171.
ISSN 0097-3165
Kupavskii, Andrey, Mustafa, Nabil H. and Swanepoel, Konrad ORCID: 0000-0002-1668-887X
(2019)
Bounding the size of an almost-equidistant set in Euclidean space.
Combinatorics, Probability and Computing, 28 (2).
pp. 280-286.
ISSN 0963-5483