Almost spanning distance trees in subsets of finite vector spaces
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2024/03/08
-
Indian UGC (journal)
-
Refrences36
-
Debsoumya Chakraborti Mathematics Institute University of Warwick Coventry UK
-
Ben Lund Discrete Mathematics Group (DIMAG) Institute for Basic Science (IBS) Daejeon South Korea
Abstract
Cite
Chakraborti, Debsoumya, and Ben Lund. “Almost Spanning Distance Trees in Subsets of Finite Vector Spaces”. Bulletin of the London Mathematical Society, 2024, https://doi.org/10.1112/blms.13022.
Chakraborti, D., & Lund, B. (2024). Almost spanning distance trees in subsets of finite vector spaces. Bulletin of the London Mathematical Society. https://doi.org/10.1112/blms.13022
Chakraborti D, Lund B. Almost spanning distance trees in subsets of finite vector spaces. Bulletin of the London Mathematical Society. 2024;.
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| A point-sphere incidence bound in odd dimensions and applications | Comptes Rendus. Mathématique |
| 2 | 2022 |
| Cycles of arbitrary length in distance graphs on Fqd$\mathbb {F}_q^d$ | Proceedings of the Steklov Institute of Mathematics |
| 2021 | |
Breaking the 3/2 Barrier for Unit Distances in Three Dimensions | International Mathematics Research Notices |
| 11 | 2019 |
| Embeddings of weighted graphs in Erdős-type settings | Moscow Journal of Combinatorics and Number Theory | 2 | 2019 | |
| Simplices over finite fields | Proceedings of the American Mathematical Society |
| 4 | 2017 |