Quadratic saturation conjecture for the convex geometric matching
Let be the convex geometric matching denoted by in the source, and let denote its saturation number on vertices. Quadratic saturation conjecture for .
The paper has an upper bound for the saturation number of and states that this upper bound is suspected to be asymptotically tight; the equivalent remains open.
References
2 papers in this index state this conjecture (2017–2021). The statement above is taken from the most recent of them; the others are arXiv:1701.03010.
Source: Jason O'Neill and Sam Spiro, “Saturation Problems in Convex Geometric Hypergraphs”, arXiv:2109.09931 (2021).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.