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

25 papers

math.CO2024

Ramsey--Dirac theory for bounded degree hypertrees

Jie Han, Seonghyuk Im, Jaehoon Kim +1

Ramsey--Turán theory considers Turán type questions in Ramsey-context, asking for the existence of a small subgraph in a graph $G$ where the complement $G$ lacks an appr…

math.CO2024

Extremal density for subdivisions with length or sparsity constraints

Jaehoon Kim, Hong Liu, Yantao Tang +3

Given a graph $H$ , a balanced subdivision of $H$ is obtained by replacing all edges of $H$ with internally disjoint paths of the same length. In this paper, we prove that for any g…

math.CO2023

A robust version of the multipartite Hajnal--Szemerédi theorem

Jie Han, Jie Hu, Donglei Yang

In this note we show the following strengthening of a multipartite version of the Hajnal--Szemerédi theorem. For an integer $r \geq 3$ and $γ > 0$ , there exists a constant $C$ such t…

math.CO2023

On powers of Hamilton cycles in Ramsey-Turán Theory

Ming Chen, Jie Han, Yantao Tang +1

We prove that for $r \in N$ with $r \geq 2$ and $μ > 0$ , there exist $α > 0$ and $n_{0}$ such that for every $n \geq n_{0}$ , every $n$ -vertex graph $G$ with $δ(G)\geq \left(1-\fr…

math.CO2023

Spanning trees in graphs without large bipartite holes

Jie Han, Jie Hu, Lidan Ping +3

We show that for any $ε > 0$ and $Δ \in N$ , there exists $α > 0$ such that for sufficiently large $n$ , every $n$ -vertex graph $G$ satisfying that $δ(G)\geq\varepsilon…

math.CO2022

Compatible Powers of Hamilton Cycles in Dense Graphs

Xiaohan Cheng, Jie Hu, Donglei Yang

Motivated by the concept of transition system investigated by Kotzig in 1968, Krivelevich, Lee and Sudakov proposed a more general notion of incompatibility system to formulate the…

math.CO2022★ 1 cited

Spanning trees in sparse expanders

Jie Han, Donglei Yang

Given integers $n \geq Δ \geq 2$ , let $T (n, Δ)$ be the collection of all $n$ -vertex trees with maximum degree at most $Δ$ . A question of Alon, Krivelevich and Sudakov in 2007…

math.CO2022

$H$ -factors in graphs with small independence number

Ming Chen, Jie Han, Guanghui Wang +1

Let $H$ be an $h$ -vertex graph. The vertex arboricity $a r (H)$ of $H$ is the least integer $r$ such that $V (H)$ can be partitioned into $r$ parts and each part induces a forest in $…

math.CO2022

Graph tilings in incompatibility systems

Jie Hu, Hao Li, Yue Wang +1

An \emph{incompatibility system} $(G, F)$ consists of a graph $G$ and a family $F = {F_{v}}_{v \in V (G)}$ over $G$ with $F_v\subseteq \{\{e,e'\}\in {E(G)\choose 2}:…

math.CO2022

Balanced subdivisions of cliques in graphs

Bingyu Luan, Yantao Tang, Guanghui Wang +1

Given a graph $H$ , a balanced subdivision of $H$ is a graph obtained from $H$ by subdividing every edge the same number of times. In 1984, Thomassen conjectured that for each integ…

math.CO2022★ 1 cited

Clique-factors in graphs with sublinear $ℓ$ -independence number

Jie Han, Ping Hu, Guanghui Wang +1

Given a graph $G$ and an integer $ℓ \geq 2$ , we denote by $α_{ℓ} (G)$ the maximum size of a $K_{ℓ}$ -free subset of vertices in $V (G)$ . A recent question of Nenadov and Pehova…

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…

math.CO2020★ 3 cited

Clique immersion in graphs without fixed bipartite graph

Hong Liu, Guanghui Wang, Donglei Yang

A graph $G$ contains $H$ as an \emph{immersion} if there is an injective mapping $ϕ : V (H) \to V (G)$ such that for each edge $uv \in E (H)$ , there is a path $P_{uv}$ in $G$ joi…

math.CO2020★ 2 cited

Flexibility of planar graphs without $C_{4}$ and $C_{5}$

Donglei Yang, Fan Yang

Let $G$ be a ${C_{4}, C_{5}}$ -free planar graph with a list assignment $L$ . Suppose a preferred color is given for some of the vertices. We prove that if all lists have size at least…

math.CO2019

Properly colored short cycles in edge-colored graphs

Laihao Ding, Jie Hu, Guanghui Wang +1

Properly colored cycles in edge-colored graphs are closely related to directed cycles in oriented graphs. As an analogy of the well-known Caccetta-Häggkvist Conjecture, we study th…

math.CO2019★ 1 cited

Antimagic orientations of graphs with given independence number

Zi-Xia Song, Donglei Yang, Fangfang Zhang

Given a digraph $D$ with $m$ arcs and a bijection $τ : A (D) \to {1, 2, \dots, m}$ , we say $(D, τ)$ is an antimagic orientation of a graph $G$ if $D$ is an orientation of $…

math.CO2019★ 3 cited

Antimagic orientations of graphs with large maximum degree

Donglei Yang, Joshua Carlson, Andrew Owens +5

Given a digraph $D$ with $m$ arcs, a bijection $τ : A (D) \to {1, 2, \dots, m}$ is an antimagic labeling of $D$ if no two vertices in $D$ have the same vertex-sum, where t…

math.CO2018

A note on antimagic orientations of even regular graphs

Donglei Yang

Motivated by the conjecture of Hartsfield and Ringel on antimagic labelings of undirected graphs, Hefetz, Mütze, and Schwartz initiated the study of antimagic labelings of digraphs…

math.CO2018

Strong list-chromatic index of subcubic graphs

Tianjiao Dai, Guanghui Wang, Donglei Yang +1

A strong $k$ -edge-coloring of a graph G is an edge-coloring with $k$ colors in which every color class is an induced matching. The strong chromatic index of $G$ , denoted by $χ'_{s}…

math.CO2018

List strong edge-coloring of graphs with maximum degree 4

Baochen Zhang, Yulin Chang, Jie Hu +2

A strong edge-coloring of a graph $G$ is an edge-coloring such that any two edges on a path of length three receive distinct colors. We denote the strong chromatic index by $χ_{s}'…

math.CO2017★ 2 cited

Antimagic orientations of even regular graphs

Tong Li, Zi-Xia Song, Guanghui Wang +2

A labeling of a digraph $D$ with $m$ arcs is a bijection from the set of arcs of $D$ to ${1, \dots, m}$ . A labeling of $D$ is antimagic if no two vertices in $D$ have the same v…

Ramsey--Dirac theory for bounded degree hypertrees

Extremal density for subdivisions with length or sparsity constraints

A robust version of the multipartite Hajnal--Szemerédi theorem

On powers of Hamilton cycles in Ramsey-Turán Theory

Spanning trees in graphs without large bipartite holes

Compatible Powers of Hamilton Cycles in Dense Graphs

Spanning trees in sparse expanders

H-factors in graphs with small independence number

Graph tilings in incompatibility systems

Balanced subdivisions of cliques in graphs

Clique-factors in graphs with sublinear ℓ-independence number

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

Clique immersion in graphs without fixed bipartite graph

Flexibility of planar graphs without C4​ and C5​

Properly colored short cycles in edge-colored graphs

Antimagic orientations of graphs with given independence number

Antimagic orientations of graphs with large maximum degree

A note on antimagic orientations of even regular graphs

Strong list-chromatic index of subcubic graphs

List strong edge-coloring of graphs with maximum degree 4

Antimagic orientations of even regular graphs

$H$ -factors in graphs with small independence number

Clique-factors in graphs with sublinear $ℓ$ -independence number

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

Flexibility of planar graphs without $C_{4}$ and $C_{5}$