collaborators

9 papers

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

The list coloring number of uncrowded hypergraphs

Jing Yu, Junchi Zhang

We prove that for every fixed integer and every , every sufficiently large finite uncrowded -uniform hypergraph of maximum degree has list chro…

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 and every , there exists such th…

math.CO2026

Strong marker sets for arbitrary generating sets of

Jing Yu

Gao and Wang proved a strong clopen marker theorem for finite generating sets of under the assumption that each generator has support of size either or . 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

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 propertie…