1 citations · 1 across the 5 of their papers we have counts for
1 paper · 1 filter
Anand Shripad Hegde, R. B. Sandeep, P. Shashank
Erdős and Gyárfás conjectured in 1994 that every graph with minimum degree at least 3 has a cycle of length a power of 2. In 2022, Gao and Shan (Graphs and Combinatorics) proved th…