Yifan Jing

activity

20172026

most citedMinimal and nearly minimal measure expansions in connected unimodular groups

6 citations · 33 across the 35 of their papers we have counts for

collaborators

Showing 2020Show all

8 papers · 1 filter

math.CO2020

A note on the largest sum-free sets of integers

Yifan Jing, Shukun Wu

Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whether $A$ contains a sum-free subset of size at least $N /3 + ω (N)$ for some increasing…

math.CO2020★ 3 cited

Efficient polynomial-time approximation scheme for the genus of dense graphs

Yifan Jing, Bojan Mohar

The main results of this paper provide an Efficient Polynomial-Time Approximation Scheme (EPTAS) for approximating the genus (and non-orientable genus) of dense graphs. By dense we…

math.CO2020

Defective DP-colorings of sparse simple graphs

Yifan Jing, Alexandr Kostochka, Fuhong Ma +1

DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvořák and Postle. We introduce and study $(i, j)$ -defective DP-colori…

math.CO2020★ 6 cited

Minimal and nearly minimal measure expansions in connected unimodular groups

Yifan Jing, Chieu-Minh Tran

Let $G$ be a connected unimodular group equipped with a (left and hence right) Haar measure $μ_{G}$ , and suppose $A, B \subseteq G$ are nonempty and compact. An inequality by Kemperm…

math.CO2020★ 3 cited

Integer colorings with forbidden rainbow sums

Yangyang Cheng, Yifan Jing, Lina Li +2

For a set of positive integers $A \subseteq [n]$ , an $r$ -coloring of $A$ is rainbow sum-free if it contains no rainbow Schur triple. In this paper we initiate the study of the rain…

math.CO2020

Color isomorphic even cycles and a related Ramsey problem

Zixiang Xu, Tao Zhang, Yifan Jing +1

In this paper, we first study a new extremal problem recently posed by Conlon and Tyomkyn~(arXiv: 2002.00921). Given a graph $H$ and an integer $k ⩾ 2$ , let $f_{k} (n, H)$ be…

math.CO2020

On the discrepancies of graphs

József Balogh, Béla Csaba, Yifan Jing +1

In the literature, the notion of discrepancy is used in several contexts, even in the theory of graphs. Here, for a graph $G$ , ${- 1, 1}$ labels are assigned to the edges, and we…

math.CO2020★ 1 cited

The largest $(k, ℓ)$ -sum-free subsets

Yifan Jing, Shukun Wu

Let $M_{(2, 1)} (N)$ be the infimum of the largest sum-free subset of any set of $N$ positive integers. An old conjecture in additive combinatorics asserts that there is a…

A note on the largest sum-free sets of integers

Efficient polynomial-time approximation scheme for the genus of dense graphs

Defective DP-colorings of sparse simple graphs

Minimal and nearly minimal measure expansions in connected unimodular groups

Integer colorings with forbidden rainbow sums

Color isomorphic even cycles and a related Ramsey problem

On the discrepancies of graphs

The largest (k,ℓ)-sum-free subsets

The largest $(k, ℓ)$ -sum-free subsets