The balanced linkless-embeddability conjecture
The balanced linkless-embeddability conjecture
Let be a -dimensional balanced simplicial complex, and let be a -admissible order. Let denote the corresponding balanced shift. Balanced linkless-embeddability conjecture. If is linklessly embeddable in , then does not contain . This generalizes the graph case motivated by the non-linkless embeddability of in .
Sources & referencesView supporting material
Primary source
Gil Kalai, Eran Nevo and Isabella Novik, “Bipartite Rigidity”, arXiv:1312.0209 (2014).
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
Sign in to submit a solution.
No solutions have been posted yet.