3 citations · 5 across the 2 of their papers we have counts for
14 papers
Large rainbow matchings in edge-colored graphs
Debsoumya Chakraborti, Po-Shen Loh
A subgraph of an edge-colored graph is called \emph{rainbow} if all of its edges have distinct colors. There has been much research on the topic of finding a large rainbow matching…
Robust Hamiltonicity in families of Dirac graphs
Michael Anastos, Debsoumya Chakraborti
A graph is called Dirac if its minimum degree is at least half of the number of vertices in it. Joos and Kim showed that every collection of Dirac g…
Regular subgraphs at every density
Debsoumya Chakraborti, Oliver Janzer, Abhishek Methuku +1
In 1975, ErdÅs and Sauer asked to estimate, for any constant , the maximum number of edges an -vertex graph can have without containing an -regular subgraph. In a recent…
Colour-biased Hamilton cycles in dense graphs and random graphs
Natalie Behague, Debsoumya Chakraborti, Jared León
A classical result of Dirac says that every -vertex graph with minimum degree at least contains a Hamilton cycle. A `discrepancy' version of Dirac's theorem was sh…
Approximate packing of independent transversals in locally sparse graphs
Debsoumya Chakraborti, Tuan Tran
Fix and consider a multipartite graph with maximum degree at most , parts of the same size , and where every vertex has a…
Sabotaging Mantel's Theorem
Natalie Behague, Debsoumya Chakraborti, Xizhi Liu
One of the earliest results in extremal graph theory, Mantel's theorem, states that the maximum number of edges in a triangle-free graph on vertices is $\lfloor n^2/4 \rflo…