1 citations · 2 across the 8 of their papers we have counts for
8 papers · 1 filter
On the Generalized Rational Exponents Conjecture
Jianfeng Hou, Caihong Yang
For fixed graphs and , let $\ex(n,H,F)$ denote the maximum number of copies of in an -vertex -free graph. In this note, we prove the generalized rational exponents…
On the boundedness of degenerate hypergraphs
Jianfeng Hou, Caiyun Hu, Heng Li +3
We investigate the impact of a high-degree vertex in Turán problems for degenerate hypergraphs (including graphs). We say an -graph is bounded if there exist constants $α, β…
Tight bounds for rainbow partial -tiling in edge-colored complete hypergraphs
Jinghua Deng, Jianfeng Hou, Xizhi Liu +1
For an -graph and integers satisfying , let denote the minimum integer such that every edge-coloring of using col…
Many vertex-disjoint even cycles of fixed length in a graph
Jianfeng Hou, Caiyun Hu, Heng Li +3
For every integer , we determine the extremal structure of an -vertex graph with at most vertex-disjoint copies of when is sufficiently large and l…
Toward a density Corrádi--Hajnal theorem for degenerate hypergraphs
Jianfeng Hou, Caiyun Hu, Heng Li +3
Given an -graph with , let denote the maximum number of edges in an -vertex -graph with at most pairwise vertex-disjoint copies…
Counting triangles in graphs without vertex disjoint odd cycles
Jianfeng Hou, Caihong Yang, Qinghou Zeng
Given two graphs and , the maximum possible number of copies of in an -free graph on vertices is denoted by . Let denote…