3 papers
math.CO2026
Triangles in graphs without the expansion of -cycle
Jialei Song, Qi Wu, Long-Tu Yuan
The expansion of a graph is the graph obtained from by replacing each edge with a triangle. Lv \etal proposed a conjecture on the maximum number of triangle…
math.CO2025
Tetrahedron Conjecture in the -norm
Levente Bodnár, Wanfang Chen, Jinghua Deng +5
The famous Tetrahedron Conjecture of Turán from the 1940s asserts that the number of edges in an -vertex -graph without the tetrahedron, the complete -graph on four vertic…
cs.DM2021
On the chromatic number of a family of odd hole free graphs
Jialei Song, Baogang Xu
A hole is an induced cycle of length at least 4, and an odd hole is a hole of odd length. A full house is a graph composed by a vertex adjacent to both ends of an edge in . L…