An inverse-type problem for cycles in local Cayley distance graphs
Combinatorics
2021-05-11 v2
Abstract
Let be a proper symmetric subset of , and be the Cayley graph with the vertex set , and two vertices and are connected by an edge if . Let be a positive integer. We show that for any , there exists large enough such that if with and , then for each vertex , there are at least cycles of length with distinct vertices in containing . This result is the inverse version of a recent result due to Iosevich, Jardine, and McDonald (2021).
Keywords
Cite
@article{arxiv.2103.11420,
title = {An inverse-type problem for cycles in local Cayley distance graphs},
author = {Thang Pham},
journal= {arXiv preprint arXiv:2103.11420},
year = {2021}
}
Comments
16 pages. V2 with some small changes