Boyuan Liu

activity

20162021

collaborators

3 papers

math.CO2021

Some exact results of the generalized Turán numbers for paths

Doudou Hei, Xinmin Hou, Boyuan Liu

For graphs $H$ and $F$ with chromatic number $χ (F) = k$ , we call $H$ strictly $F$ -Turán-good (or $(H, F)$ strictly Turán-good) if the Turán graph $T_{k - 1} (n)$ is the unique $F$ -free…

math.CO2017

$H$ -Decomposition of $r$ -graphs when $H$ is an $r$ -graph with exactly $k$ independent edges

Xinmin Hou, Boyuan Liu, Hongliang Lu

Let $ϕ_{H}^{r} (n)$ be the smallest integer such that, for all $r$ -graphs $G$ on $n$ vertices, the edge set $E (G)$ can be partitioned into at most $ϕ_{H}^{r} (n)$ parts, of which every part…

math.CO2016

Turán number and decomposition number of intersecting odd cycles

Xinmin Hou, Yu Qiu, Boyuan Liu

An extremal graph for a given graph $H$ is a graph on $n$ vertices with maximum number of edges that does not contain $H$ as a subgraph. Let $s, t$ be integers and let $H_{s, t}$ be…

Some exact results of the generalized Turán numbers for paths

H-Decomposition of r-graphs when H is an r-graph with exactly k independent edges

Turán number and decomposition number of intersecting odd cycles

$H$ -Decomposition of $r$ -graphs when $H$ is an $r$ -graph with exactly $k$ independent edges