3 papers
math.CO2026
A linear upper bound on the number of moves required for independent set reconfiguration with two sliding tokens
Nived J. M., Mathew C. Francis
We consider the problem of shifting two tokens placed on nonadjacent vertices of a graph on vertices to two nonadjacent vertices of using a sequence of to…
math.CO2024
Symmetric Union Closed Families
Nived J M
We demonstrate that when a graph exhibits a specific type of symmetry, it satisfies the Union Closed Conjecture(UCC). Additionally, we show that certain graph classes, such as Cyli…
math.CO2024
A Study On The Graph Formulation Of Union Closed Sets Conjecture
Nived J M
The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity…