3 problems

For every $D\geq 1$ and $\varepsilon>0$, there exists $\delta>0$ such that every $3$-partite $3$-graph $H$ of slicewise VC-dimension at most $D$ that is weakly $\delta$-regular sat…

Finite-graph $\mathrm{INT}_f$-minimizing partition conjecture. For every continuous and strictly concave function $f:[0,1]\rightarrow\mathbb R$ and every $\epsilon>0$, there exist…

Let $F_1,F_2,\dots,F_n$ be finite graphs, let $t_1,t_2,\dots,t_m$ be real numbers in $[0,1]$, and let $\mathcal{S}$ be the set of graphons $W$ satisfying … A graphon $W$ has polyno…