The asymptotic scarcity conjecture for collapsible hypertrees
The asymptotic scarcity conjecture for collapsible hypertrees
Let denote the family of -vertex -hypertrees, and let denote the set of -vertex -collapsible -hypertrees. Here, a -collapsible -hypertree is a -hypertree that can be reduced by elementary -collapses, each removing an exposed -face and its unique containing -face. Asymptotic scarcity conjecture. For every , asymptotically almost none of the -hypertrees are -collapsible; namely,
as . This conjecture asserts that, despite collapsibility characterizing ordinary trees, -collapsible hypertrees form a vanishing fraction of all -hypertrees in every higher dimension.
Sources & referencesView supporting material
Primary source
Nati Linial and Yuval Peled, “Enumeration and randomized constructions of hypertrees”, arXiv:1801.02423 (2018).
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
Sign in to submit a solution.
No solutions have been posted yet.