Xuqing Bai
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Combinatorics×1Discrete Math×1
Frequent co-authors
Research Timeline
2026
An improved upper bound for the planar Turán number of $C_8$
This paper proves that every simple planar graph with no copy of C8 has at most 69/25(n-2) edges, improving the previous bound.
Highlighted terms show continued research focus across papers