Shujing Miao

activity

20232026

collaborators

4 papers

math.CO2026

On the Turán number of blow-ups of $F_{5}$

Xiamiao Zhao, Xin Cheng, Dániel Gerbner +4

Let $F_{5}$ denote the $3$ -uniform hypergraph on the vertex set ${f_{1}, f_{2}, \dots, f_{5}}$ with hyperedges ${f_{1} f_{2} f_{3}, f_{1} f_{2} f_{4}, f_{3} f_{4} f_{5}}$ . Recently, Balogh, Clemen and Lu…

math.CO2026

The Turán number of Berge paths

Xin Cheng, Dániel Gerbner, Hilal Hama Karim +2

A Berge path of length $k$ in an $r$ -uniform hypergraph is a collection of $k$ hyperedges $h_{1}, \dots, h_{k}$ and $k + 1$ vertices $v_{1}, \dots, v_{k + 1}$ such that $v_{i}, v_{i + 1} \in h_{i}$ for…

math.CO2025

Rainbow Turán problems for a matching and any other graph

Dániel Gerbner, Shujing Miao

For a family of graphs $\cF$, a graph is called $\cF$-free if it does not contain any member of $\cF$ as a subgraph. Given a collection of graphs $(G_{1}, \dots, G_{t})$ on the same ver…

math.CO2023

Matching extension and matching exclusion via the size or the spectral radius of graphs

Shujing Miao, Shuchao Li, Wei Wei

A graph $G$ is said to be $k$ -extendable if every matching of size $k$ in $G$ can be extended to a perfect matching of $G$ , where $k$ is a positive integer. We say $G$ is $1$ -exclu…

On the Turán number of blow-ups of F5​

The Turán number of Berge paths

Rainbow Turán problems for a matching and any other graph

Matching extension and matching exclusion via the size or the spectral radius of graphs

On the Turán number of blow-ups of $F_{5}$