Cycle lengths modulo k in expanders

European Journal of Combinatorics（2023）

引用 0|浏览3

暂无评分

摘要

Given a constant α>0, an n-vertex graph is called an α-expander if every set X of at most n/2 vertices in G has an external neighborhood of size at least α|X|. Addressing a question posed by Friedman and Krivelevich in [Combinatorica, 41(1), (2021), pp. 53–74], we prove the following result:

查看译文

关键词

cycle lengths modulo,<mmlmath xmlnsmml=http//wwww3org/1998/math/mathml

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要