8 papers
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…
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…
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…
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…
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…
Hypergraph independence bounds: from maximum degree to average degree
Jing Yu, Junchi Zhang
We prove a transfer theorem for hereditary classes of -uniform hypergraphs. Let be such a class, and for write and for the maxim…