Jin Deng

activity

20232026

collaborators

9 papers

math.CO2026

The semi-inducibility of the blue--blue--red path on four vertices

Jinghua Deng

For an $n$ -vertex graph $G$ , let $N (H_{3}, G)$ be the number of injective labeled copies of the red-blue path $H_{3}$ for which the two blue pairs are mapped to non-edges of $G$ and the…

math.CO2026

The exact generalized Turán number for $C_6$ in $C_8$-free graphs

Zian Chen, Jinghua Deng

For graphs $F$ and $H$ , let $\ex(n,F,H)$ denote the maximum number of copies of $F$ in an $n$ -vertex $H$ -free graph. Gerbner, Győri, Methuku and Vizer proved that $\ex(n,C_6,C_8)=Θ…

math.CO2026

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 $S_{2, 1}$ , which has one distinguished center, two red edges and one blue edge. For an $n$ -vertex graph $…

math.CO2026

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 $ℓ_{2}$ -norm Turán problem for $K_{5}^{3}$ is asymptotically solved by the balanced bipartite construction, and they further conjectu…

math.CO2025

Tetrahedron Conjecture in the $ℓ_{2}$ -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 $n$ -vertex $3$ -graph without the tetrahedron, the complete $3$ -graph on four vertic…

math.CO2025

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 $n$ vertices in order to guarantee a rainbow c…

math.CO2025

Turán density of tight cycles minus one edge in the $ℓ_{2}$ -norm

Levente Bodnár, Jinghua Deng, Jianfeng Hou +2

The $3$ -uniform tight $ℓ$ -cycle minus one edge $C_{ℓ}^{3 -}$ is the $3$ -graph on $ℓ$ vertices consisting of $ℓ - 1$ consecutive triples in the cyclic order. We show that f…

math.CO2024

Tight bounds for rainbow partial $F$ -tiling in edge-colored complete hypergraphs

Jinghua Deng, Jianfeng Hou, Xizhi Liu +1

For an $r$ -graph $F$ and integers $n, t$ satisfying $t \leq n / v (F)$ , let $ar (n, tF)$ denote the minimum integer $N$ such that every edge-coloring of $K_{n}^{r}$ using $N$ col…

math.CO2023

MaxCut in graphs with sparse neighborhoods

Jinghua Deng, Jianfeng Hou, Siwei Lin +1

Let $G$ be a graph with $m$ edges and let $mc (G)$ denote the size of a largest cut of $G$ . The difference $mc (G) - m /2$ is called the surplus $sp (G)$ of $G…

The semi-inducibility of the blue--blue--red path on four vertices

The exact generalized Turán number for \(C_6\) in \(C_8\)-free graphs

Fixed-density profiles for the semi-induced 4-vertex star

Vertex-colored Turán theorems with applications in extremal hypergraph problems

Tetrahedron Conjecture in the ℓ2​-norm

Toward a rainbow Corrádi--Hajnal Theorem \RNum{1}

Turán density of tight cycles minus one edge in the ℓ2​-norm

Tight bounds for rainbow partial F-tiling in edge-colored complete hypergraphs

MaxCut in graphs with sparse neighborhoods

Tetrahedron Conjecture in the $ℓ_{2}$ -norm

Turán density of tight cycles minus one edge in the $ℓ_{2}$ -norm

Tight bounds for rainbow partial $F$ -tiling in edge-colored complete hypergraphs