3 citations · 5 across the 2 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2019
Many Turan exponents via subdivisions
Tao Jiang, Yu Qiu
Given a graph and a positive integer , the {\it Turán number} $\ex(n,H)$ is the maximum number of edges in an -vertex graph that does not contain as a subgraph. A rea…
math.CO2019★ 3 cited
Turan numbers of bipartite subdivisions
Tao Jiang, Yu Qiu
Given a graph , the Turán number is the largest number of edges in an -free graph on vertices. We make progress on a recent conjecture of Conlon, Janzer, and Le…
math.CO2018
Some sharp results on the generalized Turán numbers
Jie Ma, Yu Qiu
For graphs , let denote the maximum number of copies of in an -vertex -free graph. In this paper we prove some sharp results on this generalization of T…