Supersaturation of Odd Linear Cycles
Abstract
An $r$-uniform linear cycle of length $\ell$, denoted by $C^r_{\ell}$, is an $r$-graph with $\ell$ edges $e_1,e_2,\dots,e_{\ell}$ where $e_i=\{v_{(r-1)(i-1)},v_{(r-1)(i-1)+1},\dots,v_{(r-1)i}\}$ (here $v_0=v_{(r-1)\ell}$). For $0
Fields of Study & Subjects
Limits and Structures in Graph Theory
graph theory and CDMA systems
Advanced Graph Theory Research
Publication details
- Journal / source
- The Electronic Journal of Combinatorics
- Volume
- 33
- Issue
- 2
- Publication date
- 5 June 2026
- Language
- EN