4 problems

Quadratic saturation conjecture for the convex geometric matching $M_3$
arXiv@arxiv
Let $M_3$ be the convex geometric matching denoted by $M_3$ in the source, and let $\operatorname{sat}_\circlearrowright(n,M_3)$ denote its saturation number on $n$ vertices. Quadr…
Conjectureopenconvex-geometric-hypergraphs extremal-combinatorics saturation
1
Linear saturation conjecture for the convex geometric hypergraph $S_1$
arXiv@arxiv
Let $S_1$ be the convex geometric hypergraph denoted by $S_1$ in the source, and let $\operatorname{sat}_\circlearrowright(n,S_1)$ denote its saturation number on $n$ vertices. Lin…
Conjectureopenconvex-geometric-hypergraphs extremal-combinatorics saturation
0
Asymptotic saturation conjecture for the convex geometric hypergraph $S_3$
arXiv@arxiv
Let $S_3$ be the two-edge convex geometric $3$ -uniform hypergraph denoted by $S_3$ in the source, and let $\operatorname{sat}_\circlearrowright(n,S_3)$ denote its saturation number…
Conjectureopenconvex-geometric-hypergraphs extremal-combinatorics saturation
0
Saturation conjecture for the convex geometric hypergraph $M_1^{(r)}$
arXiv@arxiv
Let $r\ge 3$ and let $H_n^{(r)}$ be the convex geometric hypergraph defined in the source. Write $\operatorname{sat}_\circlearrowright(n,M_1^{(r)})$ for the minimum number of edges…
Conjectureopenconvex-geometric-hypergraphs extremal-combinatorics saturation
0

Quadratic saturation conjecture for the convex geometric matching M3M_3M3​