From the 1 of 7 linked papers with an AI index.
7 papers
The semi-inducibility of the blue--blue--red path on four vertices
Jinghua Deng
The paper determines the maximum asymptotic density of a red‑blue path on four vertices in large graphs and identifies the extremal construction as a disjoint union of a clique and…
The exact generalized Turán number for \(C_6\) in \(C_8\)-free graphs
Zian Chen, Jinghua Deng
For graphs and , let $\ex(n,F,H)$ denote the maximum number of copies of in an -vertex -free graph. Gerbner, GyÅri, Methuku and Vizer proved that $\ex(n,C_6,C_8)=…
Fixed-density profiles for the semi-induced 4-vertex star
Jinghua Deng, Jianfeng Hou
We study the fixed-density semi-inducibility profiles of the red-blue star , which has one distinguished center, two red edges and one blue edge. For an -vertex graph $…
Vertex-colored Turán theorems with applications in extremal hypergraph problems
Wanfang Chen, Jinghua Deng, Jianfeng Hou +2
Balogh, Clemen, and Lidický proved that the -norm Turán problem for is asymptotically solved by the balanced bipartite construction, and they further conjec…
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 verti…
Toward a rainbow Corrádi--Hajnal Theorem \RNum{1}
Deng Jinghua, Hou Jianfeng, Hu caiyun +1
We study an anti-Ramsey extension of the classical Corrádi--Hajnal Theorem: how many colors are needed to color the complete graph on vertices in order to guarantee a rainbow…