activity
20172024
most citedFlexibility of planar graphs without and

2 citations · 5 across the 7 of their papers we have counts for

collaborators
Showing math.COShow all

11 papers · 1 filter

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 where the complement lacks an appr…

math.CO2024

Extremal density for subdivisions with length or sparsity constraints

Jaehoon Kim, Hong Liu, Yantao Tang +3

Given a graph , a balanced subdivision of is obtained by replacing all edges of 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 and , there exists a constant 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 with and , there exist and such that for every , every -vertex graph with $δ(G)\geq \left(1-\fr…

math.CO20202 cited

Flexibility of planar graphs without and

Donglei Yang, Fan Yang

Let be a -free planar graph with a list assignment . Suppose a preferred color is given for some of the vertices. We prove that if all lists have size at least…

math.CO20191 cited

Antimagic orientations of graphs with given independence number

Zi-Xia Song, Donglei Yang, Fangfang Zhang

Given a digraph with arcs and a bijection , we say is an antimagic orientation of a graph if is an orientation of $…