6 papers
Strong non-principality of positive codegree Turán density
Levente Bodnár, Jun Gao, Oleg Pikhurko +2
The \emph{minimum positive codegree} of a -graph is the minimum, over all -sets that lie in at least one edge, of the number of edges containing that…
Rational codegree Turán density of hypergraphs
Jun Gao, Oleg Pikhurko, Mingyuan Rong +1
Let be a -graph (i.e. a -uniform hypergraph). Its minimum codegree is the largest integer such that every -subset of is contained in at le…
The codegree Turán density of tight cycles
Jie Ma, Mingyuan Rong
The codegree Turán density of a -uniform hypergraph is the minimum real number such that every -uniform hypergraph on sufficiently many vertices, i…
Recent advances in arrow relations and traces of sets
Mingze Li, Jie Ma, Mingyuan Rong
The arrow relation, a central concept in extremal set theory, captures quantitative relationships between families of sets and their traces. Formally, the arrow relation $(n, m) \r…
Variants of VC dimension and their applications to dynamics
Guorong Gao, Jie Ma, Mingyuan Rong +1
Since its introduction by Vapnik and Chervonenkis in the 1960s, the VC dimension and its variants have played a central role in numerous fields. In this paper, we investigate sever…
Exact results on traces of sets
Mingze Li, Jie Ma, Mingyuan Rong
For non-negative integers , , and , we write if for every family with $|\mathcal{F}|…