Da-Qi Chen

activity

20192023

most citedMany cliques with few edges and bounded maximum degree

8 citations · 13 across the 7 of their papers we have counts for

collaborators

Showing 2020Show all

3 papers · 1 filter

math.CO2020★ 2 cited

Minimizing the number of edges in $K_{s, t}$ -saturated bipartite graphs

Debsoumya Chakraborti, Da Qi Chen, Mihir Hasabnis

This paper considers an edge minimization problem in saturated bipartite graphs. An $n$ by $n$ bipartite graph $G$ is $H$ -saturated if $G$ does not contain a subgraph isomorphic to…

math.CO2020★ 2 cited

Exact results on generalized Erdős-Gallai problems

Debsoumya Chakraborti, Da Qi Chen

Generalized Turán problems have been a central topic of study in extremal combinatorics throughout the last few decades. One such problem is maximizing the number of cliques of siz…

math.CO2020★ 8 cited

Many cliques with few edges and bounded maximum degree

Debsoumya Chakraborti, Da Qi Chen

Generalized Turán problems have been a central topic of study in extremal combinatorics throughout the last few decades. One such problem, maximizing the number of cliques of a fix…

Minimizing the number of edges in Ks,t​-saturated bipartite graphs

Exact results on generalized Erdős-Gallai problems

Many cliques with few edges and bounded maximum degree

Minimizing the number of edges in $K_{s, t}$ -saturated bipartite graphs