Jian Wang

activity

20122026

most citedThe formula for Turán number of spanning linear forests

18 citations · 33 across the 23 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

math.CO2021

A Note on Minimum Degree Condition for Hamiltonian $(a, b)$ -Cycles in Hypergraphs

Jian Wang

Let $k, a, b$ be positive integers with $a + b = k$ . A $k$ -uniform hypergraph is called an $(a, b)$ -cycle if there is a partition $(A_{0}, B_{0}, A_{1}, B_{1}, \dots, A_{t - 1}, B_{t - 1})$ of the vertex…

math.CO2021

On the sum of sizes of overlapping families

Peter Frankl, Jian Wang

Let $A_{1}, \dots, A_{m}$ be families of $k$ -subsets of an $n$ -set. Suppose that one cannot choose pairwise disjoint edges from $s + 1$ distinct families. Subject to t…

math.CO2021★ 1 cited

The Generalized Turán Problem of Two Intersecting Cliques

Erica L. L. Liu, Jian Wang

For $s < r$ , let $B_{r, s}$ be the graph consisting of two copies of $K_{r}$ , which share exactly $s$ vertices. Denote by $e x (n, K_{r}, B_{r, s})$ the maximum number of copies of $K_{r}$ in…

A Note on Minimum Degree Condition for Hamiltonian (a,b)-Cycles in Hypergraphs

On the sum of sizes of overlapping families

The Generalized Turán Problem of Two Intersecting Cliques

A Note on Minimum Degree Condition for Hamiltonian $(a, b)$ -Cycles in Hypergraphs