Cycle Lemma
Cycle Lemma is a combinatorial theorem that, in the context of bijective combinatorics, characterizes the number of cyclic shifts of a sequence of parentheses or steps that result in a valid Dyck path, distinguishing it from general enumeration lemmas by its focus on cyclic invariance and dominance properties.
19
Publications
646
Citations
34
Authors
26
Institutions
Publications per year
2017–2026
1
Variants
Raney's Lemma
Parents
19
Universal cycles of k-subsets and k-permutations
Brad Jackson · Discrete Mathematics · 1993 · 71 citations
A Note on Cycle Lengths in Graphs
R.J. Gould, Penny Haxell, Alex Scott · Graphs and Combinatorics · 2002 · 27 citations
1–5 of 19
34
1
h-index
1 publications · 12 citations
1
h-index
University of Illinois Urbana-Champaign, United States
1 publications · 69 citations
1
h-index
1
h-index
1
h-index
1–5 of 34
26

University of Waterloo
Waterloo, Canada
2 h-index
2 publications
38 citations
University of Rhode Island
Kingston, United States
1 h-index
2 publications
46 citations
Technion – Israel Institute of Technology
Haifa, Israel
1 h-index
1 publications
69 citations

Fuzhou University
Fuzhou, China
1 h-index
1 publications
195 citations
San Jose State University
San Jose, United States
1 h-index
1 publications
71 citations
Universidad del Noreste
Tampico, Mexico
1 h-index
1 publications
16 citations

Sichuan University
Chengdu, China
1 h-index
1 publications
13 citations
Academia Sinica
Taipei, Taiwan
1 h-index
1 publications
16 citations
1–8 of 26
6 publications · 146 citations
6
h-index
3 publications · 52 citations
3
h-index
2 publications · 79 citations
2
h-index
1 publications · 27 citations
1
h-index
1 publications · 69 citations
1
h-index
1–5