Kalai's tight hypertree conjecture
Statement
Let be an -uniform hypergraph with vertices, and let a tight -uniform hypertree with edges be the target hypergraph.
Kalai's conjecture. If
then contains a copy of every tight -uniform hypertree with edges.
This is a hypergraph generalization of the Erdős–Sós conjecture. The source presents it as an open problem among generalizations to hypergraphs and directed graphs.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.