Debsoumya Chakraborti

According to our database, Debsoumya Chakraborti authored at least 19 papers between 2020 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Sabotaging Mantel's Theorem.

Natalie C. Behague, Debsoumya Chakraborti, Xizhi Liu

Electron. J. Comb., 2026

2025

Twin-Width of Subdivisions of Multigraphs.

Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey, Sang-il Oum

SIAM J. Discret. Math., 2025

Approximate packing of independent transversals in locally sparse graphs.

Debsoumya Chakraborti, Tuan Tran

J. Comb. Theory B, 2025

2024

Hamilton Transversals in Tournaments.

Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee, Jaehyeon Seo

Comb., December, 2024

Rainbow Saturation for Complete Graphs.

Debsoumya Chakraborti, Kevin Hendrey, Ben Lund, Casey Tompkins

SIAM J. Discret. Math., March, 2024

On a rainbow extremal problem for color-critical graphs.

Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee, Hong Liu, Jaehyeon Seo

Random Struct. Algorithms, March, 2024

Twin-width of random graphs.

Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey, Donggyu Kim, Sang-il Oum

Random Struct. Algorithms, 2024

Exact results on generalized Erdős-Gallai problems.

Debsoumya Chakraborti, Da Qi Chen

Eur. J. Comb., 2024

2023

Fractional Helly Theorem for Cartesian Products of Convex Sets.

Debsoumya Chakraborti, Jaehoon Kim, Jinha Kim, Minki Kim, Hong Liu

Discret. Comput. Geom., December, 2023

Extremal bipartite independence number and balanced coloring.

Debsoumya Chakraborti

Eur. J. Comb., October, 2023

Majority dynamics on sparse random graphs.

Debsoumya Chakraborti, Jeong Han Kim, Joonkyung Lee, Tuan Tran

Random Struct. Algorithms, August, 2023

Colorful Hamilton Cycles in Random Graphs.

Debsoumya Chakraborti, Alan M. Frieze, Mihir Hasabnis

SIAM J. Discret. Math., March, 2023

2021

Minimizing the Number of Edges in K_{(s, t)}-Saturated Bipartite Graphs.

Debsoumya Chakraborti, Da Qi Chen, Mihir Hasabnis

SIAM J. Discret. Math., 2021

Many cliques with few edges and bounded maximum degree.

Debsoumya Chakraborti, Da Qi Chen

J. Comb. Theory B, 2021

Isomorphism for random <i>k</i>-uniform hypergraphs.

Debsoumya Chakraborti, Alan M. Frieze, Simi Haber, Mihir Hasabnis

Inf. Process. Lett., 2021

Well-mixing vertices and almost expanders.

Debsoumya Chakraborti, Jaehoon Kim, Jinha Kim, Minki Kim, Hong Liu

CoRR, 2021

The Threshold for the Full Perfect Matching Color Profile in a Random Coloring of Random Graphs.

Debsoumya Chakraborti, Mihir Hasabnis

Electron. J. Comb., 2021

2020

Extremal Graphs with Local Covering Conditions.

Debsoumya Chakraborti, Po-Shen Loh

SIAM J. Discret. Math., 2020

Minimizing the numbers of cliques and cycles of fixed size in an F-saturated graph.

Debsoumya Chakraborti, Po-Shen Loh

Eur. J. Comb., 2020