Submitted Papers

  1. D. Chakraborti, Jaehoon Kim, Hyunwoo Lee, Hong Liu, and Jaehyeon Seo, On a rainbow extremal problem for color-critical graphs.
  2. D. Chakraborti, Extremal bipartite independence number and balanced coloring.
  3. D. Chakraborti, Jeong Han Kim, Joongkyung Lee, and Tuan Tran, Majority dynamics on sparse random graphs.
  4. D. Chakraborti and Po-Shen Loh, Rainbow matchings in edge-colored simple graphs.
  5. D. Chakraborti and Da Qi Chen, Exact results on generalized Erdős-Gallai problems.
  6. D. Chakraborti, Alan Frieze, and Mihir Hasabnis, Colorful Hamilton cycles in random graphs.

Published Papers

  1. D. Chakraborti, Jaehoon Kim, Jinha Kim, Minki Kim, and Hong Liu, Well-mixing vertices and almost expanders, Proceedings of the American Mathematical Society.
  2. D. Chakraborti, Jaehoon Kim, Jinha Kim, Minki Kim, and Hong Liu, Fractional Helly theorem for Cartesian products of convex sets, to appear in Discrete & Computational Geometry.
  3. D. Chakraborti and Da Qi Chen, Many cliques with few edges and bounded maximum degree, Journal of Combinatorial Theory, Series B, 151 (2021), 1–20.
  4. D. Chakraborti, Da Qi Chen, and Mihir Hasabnis, Minimizing the number of edges in $K_{s,t}$-saturated bipartite graphs, SIAM Journal on Discrete Mathematics, 35(2) (2021), 1165–1181.
  5. D. Chakraborti and Mihir Hasabnis, The threshold for the full perfect matching color profile in a random coloring of random graphs, Electronic Journal of Combinatorics, 28(1) (2021), P1.21.
  6. D. Chakraborti, Tomasz Tkocz, and Beatrice-Helen Vritsiou, A note on volume thresholds for random polytopes, Geometriae Dedicata, 213 (2021), 423–431.
  7. D. Chakraborti, Alan Frieze, Simi Haber, and Mihir Hasabnis, Isomorphism for Random k-Uniform Hypergraphs, Information Processing Letters, 166 (2021), 106039.
  8. D. Chakraborti, Alan Frieze, and Mihir Hasabnis, The game chromatic number of a random hypergraph, Discrete Mathematics and Applications, 165 (2020), 153–175.
  9. D. Chakraborti and Po-Shen Loh, Minimizing the numbers of cliques and cycles of fixed size in an F-saturated graph, European Journal of Combinatorics, 90 (2020), 103185.
  10. D. Chakraborti and Po-Shen Loh, Extremal graphs with local covering conditions, SIAM Journal on Discrete Mathematics, 34(2) (2020), 1354–1374.

Coauthors

Da Qi Chen, Alan Frieze, Simi Haber, Mihir Hasabnis, Jaehoon Kim, Jeong Han KimJinha KimMinki Kim, Hyunwoo Lee, Joongkyung Lee, Hong Liu, Po-Shen Loh, Jaehyeon Seo, Tomasz Tkocz, Tuan Tran, Beatrice-Helen Vritsiou.