Showing math.COShow all
2 papers · 1 filter
math.CO2025
Improved upper bounds on color reversal by local inversions
Kumud Singh Porte, RB Sandeep, Kamal Santra
We study the problem of color reversal in bicolored graphs under local inversions. A \emph{bicoloration} of a graph is a mapping . A \emph{local invers…
math.CO2024
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 th…