Debsoumya Chakraborti

collaborators

3 papers

math.CO2024

Transversal cycles and paths in tournaments

Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee +1

Thomason [ $Trans. Amer. Math. Soc.$ 296.1 (1986)] proved that every sufficiently large tournament contains Hamilton paths and cycles with all possible orientations, except…

math.CO2024

Edge-disjoint cycles with the same vertex set

Debsoumya Chakraborti, Oliver Janzer, Abhishek Methuku +1

In 1975, Erdős asked for the maximum number of edges that an $n$ -vertex graph can have if it does not contain two edge-disjoint cycles on the same vertex set. It is known that Turá…

math.CO2023

A bandwidth theorem for graph transversals

Debsoumya Chakraborti, Seonghyuk Im, Jaehoon Kim +1

Given a collection $G = (G_{1}, \dots, G_{h})$ of graphs on the same vertex set $V$ of size $n$ , an $h$ -edge graph $H$ on the vertex set $V$ is a $G$ -transversal if th…