Yue Ma

activity

20182022

most citedMinimum degree of 3-graphs without long linear paths

1 citations · 3 across the 7 of their papers we have counts for

collaborators

10 papers

math.CO2022

The degree and codegree threshold for linear triangle covering in 3-graphs

Yuxuan Tang, Yue Ma, Xinmin Hou

Given two $k$ -uniform hypergraphs $F$ and $G$ , we say that $G$ has an $F$ -covering if every vertex in $G$ is contained in a copy of $F$ . For $1 \leq i \leq k - 1$ , let $c_{i} (n, F)$ be the…

math.CO2021

Rainbow independent sets in graphs with maximum degree two

Yue Ma, Xinmin Hou, Jun Gao +2

Given a graph $G$ , let $f_{G} (n, m)$ be the minimal number $k$ such that every $k$ independent $n$ -sets in $G$ have a rainbow $m$ -set. Let $D (2)$ be the family of all grap…

math.CO2020★ 1 cited

The Turán number for the edge blow-up of trees

Anyao Wang, Xinmin Hou, Boyuan Liu +1

The edge blow-up of a graph $F$ is the graph obtained from replacing each edge in $F$ by a clique of the same size where the new vertices of the cliques are all different. In this…

math.CO2020★ 1 cited

Maximizing the number of independent sets of fixed size in $K_{n}$ -covered graphs

Anyao Wang, Xinmin Hou, Boyuan Liu +1

A graph $G$ is $H$ -covered by some given graph $H$ if each vertex in $G$ is contained in a copy of $H$ . In this note, we give the maximum number of independent sets of size $t\ge 3…

math.CO2020

Exact minimum codegree thresholds for $K_{4}^{-}$ -covering and $K_{5}^{-}$ -covering

Lei Yu, Xinmin Hou, Boyuan Liu +1

Given two $3$ -graphs $F$ and $H$ , an $F$ -covering of $H$ is a collection of copies of $F$ in $H$ such that each vertex of $H$ is contained in at least one copy of them. Let {$c_2(n…

math.CO2020

Minimizing the number of edges in $C_{\geq r}$ -saturated graphs

Yue Ma, Xinmin Hou, Doudou Hei +1

Given a family of graphs $F$ , a graph $G$ is said to be $F$ -saturated if $G$ does not contain a copy of $F$ as a subgraph for any $F \in F$ but the addi…

The degree and codegree threshold for linear triangle covering in 3-graphs

Rainbow independent sets in graphs with maximum degree two

The Turán number for the edge blow-up of trees

Maximizing the number of independent sets of fixed size in Kn​-covered graphs

Exact minimum codegree thresholds for K4−​-covering and K5−​-covering

Minimizing the number of edges in C≥r​-saturated graphs

Maximizing the number of independent sets of fixed size in $K_{n}$ -covered graphs

Exact minimum codegree thresholds for $K_{4}^{-}$ -covering and $K_{5}^{-}$ -covering

Minimizing the number of edges in $C_{\geq r}$ -saturated graphs