Jing Yu

activity

20232026

collaborators

11 papers

math.CO2026

Random independent sets in triangle-free and linear Berge- $C_{4}$ -free hypergraphs

Jing Yu, Junchi Zhang

We study probability distributions on independent sets of uniform hypergraphs with local constraints. For a positive vertex-weight function $w$ on an $(r + 1)$ -uniform hypergraph, de…

math.CO2026

Infinitesimal finite forcibility and step kernels

Xichao Shu, Jing Yu, Junchi Zhang

We characterize infinitesimal finite forcibility for bounded symmetric real kernels. We prove that the graph-density gradients at a kernel span a finite-dimensional space if and on…

math.CO2026

On independent sets in uncrowded uniform hypergraphs

Jing Yu, Junchi Zhang

We prove an average-degree lower bound on the independence number of uncrowded uniform hypergraphs. For every fixed $r \geq 2$ and every $η > 0$ , there exists $d_{*} = d_{*} (r, η)$ such that…

math.CO2026

The list coloring number of uncrowded hypergraphs

Jing Yu, Junchi Zhang

We prove that for every fixed integer $r \geq 2$ and every $ε > 0$ , every sufficiently large finite uncrowded $(r + 1)$ -uniform hypergraph of maximum degree $Δ$ has list chrom…

math.CO2026

Strong marker sets for arbitrary generating sets of $Z^{n}$

Jing Yu

Gao and Wang proved a strong clopen marker theorem for finite generating sets of $Z^{n}$ under the assumption that each generator has support of size either $1$ or $n$ . We sh…

math.CO2026

Submodular flows and extreme flows on measurable spaces

Jing Yu, Junchi Zhang, Mingyang Zhou

The theory of submodular flows, introduced by Edmonds and Giles, is a cornerstone of combinatorial optimization, unifying network flows, matroid intersections and directed cut cove…

math.CO2026

Hypergraph independence bounds: from maximum degree to average degree

Jing Yu, Junchi Zhang

We prove a transfer theorem for hereditary classes of $(r + 1)$ -uniform hypergraphs. Let $H$ be such a class, and for $H \in H$ write $Δ (H)$ and $d (H)$ for the maximu…

math.CO2024

Borel Local Lemma: arbitrary random variables and limited exponential growth

Anton Bernshteyn, Jing Yu

The Lovász Local Lemma (the LLL for short) is a powerful tool in probabilistic combinatorics that is used to verify the existence of combinatorial objects with desirable properties…

math.CO2024

Embedding Borel graphs into grids of asymptotically optimal dimension

Anton Bernshteyn, Jing Yu

Let $G$ be a Borel graph all of whose finite subgraphs embed into the $d$ -dimensional grid with diagonals. We show that then $G$ itself admits a Borel embedding into the Schreier g…

math.AG2023

Torus knots in Lens spaces, open Gromov-Witten invariants, and topological recursion

Jinghao Yu, Zhengyu Zong

Starting from a torus knot $K$ in the lens space $L (p, - 1)$ , we construct a Lagrangian sub-manifold $L_{K}$ in $\mathcal{X}=\big(\mathcal{O}_{\mathbb{P}^1}(-1)\o…

math.CO2023

Large-scale geometry of Borel graphs of polynomial growth

Anton Bernshteyn, Jing Yu

We study graphs of polynomial growth from the perspective of asymptotic geometry and descriptive set theory. The starting point of our investigation is a theorem of Krauthgamer and…

Random independent sets in triangle-free and linear Berge-C4​-free hypergraphs

Infinitesimal finite forcibility and step kernels

On independent sets in uncrowded uniform hypergraphs

The list coloring number of uncrowded hypergraphs

Strong marker sets for arbitrary generating sets of Zn

Submodular flows and extreme flows on measurable spaces

Hypergraph independence bounds: from maximum degree to average degree

Borel Local Lemma: arbitrary random variables and limited exponential growth

Embedding Borel graphs into grids of asymptotically optimal dimension

Torus knots in Lens spaces, open Gromov-Witten invariants, and topological recursion

Large-scale geometry of Borel graphs of polynomial growth

Random independent sets in triangle-free and linear Berge- $C_{4}$ -free hypergraphs

Strong marker sets for arbitrary generating sets of $Z^{n}$