Shumin Sun

activity

20242026

collaborators

3 papers

math.CO2026

Tilings in quasi-random $k$ -partite hypergraphs

Shumin Sun

Given $k \geq 2$ and two $k$ -graphs ( $k$ -uniform hypergraphs) $F$ and $H$ , an $F$ -factor in $H$ is a set of vertex disjoint copies of $F$ that together cover the vertex set of $H$ . L…

math.CO2025

On the $(k + 2, k)$ -problem of Brown, ErdÅs and SÃ³s for $k = 5, 6, 7$

Stefan Glock, Jaehoon Kim, Lyuben Lichev +2

Let $f^{(r)} (n; s, k)$ denote the maximum number of edges in an $n$ -vertex $r$ -uniform hypergraph containing no subgraph with $k$ edges and at most $s$ vertices. Brown, ErdÅs and SÃ…

math.CO2024

Induced even cycles in locally sparse graphs

Laihao Ding, Jun Gao, Hong Liu +2

A graph $G$ is $(c, t)$ -sparse if for every pair of vertex subsets $A, B \subset V (G)$ with $∣ A ∣, ∣ B ∣ \geq t$ , $e (A, B) \leq (1 - c) ∣ A ∣∣ B ∣$ . In this paper we prove that for every $c > 0$ and…

Tilings in quasi-random k-partite hypergraphs

On the (k+2,k)-problem of Brown, ErdÅs and SÃ³s for k=5,6,7

Induced even cycles in locally sparse graphs

Tilings in quasi-random $k$ -partite hypergraphs

On the $(k + 2, k)$ -problem of Brown, ErdÅs and SÃ³s for $k = 5, 6, 7$