The complexity of decomposing a graph into a matching and a bounded linear forest. - Agnijo Banerjee; João Pedro Marciano; Adva Mond; Jan Petr; Julien Portier (CoRR, 2023)

A Proof of a Frankl-Kupavskii Conjecture on Intersecting Families. - Agnijo Banerjee (Comb., 2024)