3 papers
math.CO2025
On the Turán number of odd-ballooning of -chromatic graphs
Longfei Fang, Xueyi Huang, Huiqiu Lin +1
Given a graph , the Turán number is the maximum number of edges in any -vertex -free graph. The odd-ballooning of , denoted by , is a graph obtai…
math.CO2023
Spectral condition for the existence of a chorded cycle
Jiaxin Zheng, Xueyi Huang, Junjie Wang
A chord of a cycle is an edge joining two non-consecutive vertices of . A cycle in a graph is chorded if the vertex set of induces at least one chord. In this pa…
math.CO2023
Turán problem for -free signed graph
Junjie Wang, Yaoping Hou, Xueyi Huang
In this paper, we study the Turán problem for . Suppose that is an unbalanced signed graph of order with edges. Let be th…