collaborators

1 paper

math.CO2025

Erdős-Gyárfás conjecture on graphs without long induced paths

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…