Donglei Yang

activity

20172024

most citedAntimagic orientations of graphs with large maximum degree

3 citations · 13 across the 24 of their papers we have counts for

collaborators

Showing 2021Show all

4 papers · 1 filter

math.CO2021

Embedding clique-factors in graphs with low $ℓ$ -independence number

Fan Chang, Jie Han, Jaehoon Kim +2

The following question was proposed by Nenadov and Pehova and reiterated by Knierim and Su: Given integers $ℓ, r$ and $n$ with $n \in r N$ , is it true that every $n$ -verte…

math.CO2021

Transversal Hamilton cycle in hypergraph systems

Yangyang Cheng, Jie Han, Bin Wang +2

A $k$ -graph system $H = {H_{i}}_{i \in [m]}$ is a family of not necessarily distinct $k$ -graphs on the same $n$ -vertex set $V$ and a $k$ -graph $H$ on $V$ is said to be $\textb…

math.CO2021

Shape of the asymptotic maximum sum-free sets in integer lattice grids

Hong Liu, Guanghui Wang, Laurence Wilkes +1

We determine the shape of all sum-free sets in ${1, 2, \dots, n}^{2}$ of size close to the maximum $\frac{3}{5} n^{2}$ , solving a problem of Elsholtz and Rackham. We show that all such…

math.CO2021

A Ramsey-Turán theory for tilings in graphs

Jie Han, Patrick Morris, Guanghui Wang +1

For a $k$ -vertex graph $F$ and an $n$ -vertex graph $G$ , an $F$ -tiling in $G$ is a collection of vertex-disjoint copies of $F$ in $G$ . For $r \in N$ , the $r$ -independence nu…

Embedding clique-factors in graphs with low ℓ-independence number

Transversal Hamilton cycle in hypergraph systems

Shape of the asymptotic maximum sum-free sets in integer lattice grids

A Ramsey-Turán theory for tilings in graphs

Embedding clique-factors in graphs with low $ℓ$ -independence number