Conjecture on limiting Turán densities of iterated suspensions
Let be the suspension of a hypergraph , obtained by adjoining a new vertex and adding it to every edge of , and let denote the -fold iterated suspension. Let be the object associated with in the paper's definition of the limiting construction, and let denote its Turán density.
Iterated-suspension limit conjecture. For all hypergraphs ,
The source proves the monotonic inequality and notes preservation of degeneracy under suspension, but does not establish this limiting formula.
References
Primary source
Travis Johnston and Linyuan Lu, “Turan Problems on Non-uniform Hypergraphs”, arXiv:1301.1870 (2013).
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.