7 problems

The bipartite graph gluing conjecture. One has

Let $F_5$ be the 3-uniform hypergraph considered in the $(2,p)$-norm Turán problem, and let $\rho_{2,p}(F_5)$ denote its asymptotic extremal value. For a Steiner triple system (STS…

Let $d$ be a positive integer, and let $\lambda_d$ be the universal exponent for homeomorphs of fixed $d$-complexes, defined by … for every fixed $d$-complex $S$. Matching lower-bo…

Localized hypergraph clique-weight conjecture. One has

Frohmader's localized clique-weight conjecture. For every $m$-edge graph $G$,

Regular Turán bound. For such a graph $F$,

Finite Turán threshold conjecture. Every poset has a finite Turán threshold, that is, $\pi^{*}(P)<\infty$ for every finite poset $P$.