Asymptotic extremal conjecture for ordered 3-uniform tight paths
Let denote the maximum number of edges in an -vertex ordered 3-uniform hypergraph avoiding the ordered tight-path configuration with parameter , and let be the ordered 3-uniform tight path on vertices. Define
and, equivalently,
Asymptotic extremal conjecture for ordered 3-uniform tight paths. The constructions described in the source are asymptotically optimal:
Equivalently,
The preceding constructions give the corresponding lower bounds, so the conjecture concerns matching asymptotic upper bounds for all relevant parameters.
References
- John P. Bright, Kevin G. Milans and Jackson Porter, “Turán Numbers of Ordered Tight Hyperpaths”, arXiv:2212.13719 (2022).
Progress summary
Never refreshed
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.