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 math.COShow all

22 papers · 1 filter

math.CO2026

Computing Tools for Translation-Invariant Total Orders

Yifan Jing, Emma Yicheng Lou, Shaotian Sun +1

We introduce TITO_Explore, a software package for representing and computing with Translation-Invariant Total Orders (TITOs). We define a canonical window notation for TITOs and de…

math.CO2026

Roth-type theorems in $K_{s, t}$ -free sets

Yifan Jing, Cosmin Pohoata, Max Wenqiang Xu

We show that for all integers $2 \leq s \leq t$ , any $K_{s, t}$ -free subset of $[N]$ with size $Ω (n^{1 - 1/ s})$ must contain a nontrivial solution to every fixed translation-invariant lin…

math.CO2024

A group-action Szemerédi-Trotter theorem and applications to orchard problems in all characteristics

Yifan Jing, Tingxiang Zou

We establish a group-action version of the Szemerédi-Trotter theorem over any field, extending Bourgain's result for the group $SL_{2} (k)$ . As an Elekes-Szabó-type applicati…

math.CO2024

Brunn-Minkowski type estimates for certain discrete sumsets

Albert Lopez Bruch, Yifan Jing, Akshat Mudgal

Let $d, k$ be natural numbers and let $L_{1}, \dots, L_{k} \in GL_{d} (Q)$ be linear transformations such that there are no non-trivial subspaces $U,…

math.CO2023

Kemperman's inequality and Freiman's lemma via few translates

Yifan Jing, Akshat Mudgal

Let $G$ be a connected compact group equipped with the normalised Haar measure $μ$ . Our first result shows that given $α, β > 0$ , there is a constant $c = c (α, β) > 0$ such that for any…

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…

math.CO2019★ 2 cited

Defective DP-colorings of sparse multigraphs

Yifan Jing, Alexandr Kostochka, Fuhong Ma +2

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

math.CO2019

Expanding Polynomials and Pairs of Polynomials in Characteristic 0

Yifan Jing, Souktik Roy, Chieu-Minh Tran

We begin a generalized study of sum-product type phenomenon in different fields by considering pairs $P (x, y)$ and $Q (x, y)$ of two variable polynomials that simultaneously exhibit s…

math.CO2019

Small doublings in abelian groups of prime power torsion

Yifan Jing, Souktik Roy

Let $A$ be a subset of $G$ , where $G$ is a finite abelian group of torsion $r$ . It was conjectured by Ruzsa that if $∣ A + A ∣ \leq K ∣ A ∣$ , then $A$ is contained in a coset of $G$ of siz…

math.CO2019★ 1 cited

Non-bipartite distance-regular graphs with a small smallest eigenvalue

Zhi Qiao, Yifan Jing, Jack Koolen

In 2017, Qiao and Koolen showed that for any fixed integer $D \geq 3$ , there are only finitely many such graphs with $θ_{m i n} \leq - α k$ , where $0 < α < 1$ is any fixed number. In this p…

math.CO2018★ 1 cited

On the structure of (claw,bull)-free graphs

Sebastián González Hermosillo de la Maza, Yifan Jing, Masood Masjoody

In this research, we determine the structure of (claw, bull)-free graphs. We show that every connected (claw, bull)-free graph is either an expansion of a path, an expansion of a c…

math.CO2018

On vertex-induced weighted Turán problems

Zixiang Xu, Yifan Jing, Gennian Ge

Recently, Bennett et al. introduced the vertex-induced weighted Turán problem. In this paper, we consider their open Turán problem under sum-edge-weight function and characterize t…

math.CO2018★ 1 cited

Counting maximal near perfect matchings in quasirandom and dense graphs

Yifan Jing, Akbar Rafiey

A maximal $ε$ -near perfect matching is a maximal matching which covers at least $(1 - ε) ∣ V (G) ∣$ vertices. In this paper, we study the number of maximal near perfe…

math.CO2018

The genus of complete 3-uniform hypergraphs

Yifan Jing, Bojan Mohar

In 1968, Ringel and Youngs confirmed the last open case of the Heawood Conjecture by determining the genus of every complete graph $K_{n}$ . In this paper, we investigate the minimum…

math.CO2017★ 3 cited

The genus of a random bipartite graph

Yifan Jing, Bojan Mohar

Archdeacon and Grable (1995) proved that the genus of the random graph $G \in G_{n, p}$ is almost surely close to $p n^{2} /12$ if $p = p (n) \geq 3 (ln n)^{2} n^{- 1/2}$ . In this paper…

Computing Tools for Translation-Invariant Total Orders

Roth-type theorems in Ks,t​-free sets

A group-action Szemerédi-Trotter theorem and applications to orchard problems in all characteristics

Brunn-Minkowski type estimates for certain discrete sumsets

Kemperman's inequality and Freiman's lemma via few translates

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

Defective DP-colorings of sparse multigraphs

Expanding Polynomials and Pairs of Polynomials in Characteristic 0

Small doublings in abelian groups of prime power torsion

Non-bipartite distance-regular graphs with a small smallest eigenvalue

On the structure of (claw,bull)-free graphs

On vertex-induced weighted Turán problems

Counting maximal near perfect matchings in quasirandom and dense graphs

The genus of complete 3-uniform hypergraphs

The genus of a random bipartite graph

Roth-type theorems in $K_{s, t}$ -free sets

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