Copiousness conjecture for irreducible hypertrees
Statement
Let be an irreducible hypertree, and identify it with its graph , whose edges are the pairs occurring in the triples of . Irreducible hypertree copiousness conjecture. Every irreducible hypertree is copious. The paper proves this for irreducible hypertrees with vertices and proves separately that every bipyramid is topologically copious, hence copious; the general assertion remains open.
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.