1 problem

Elliott–Rödl's hypertree embedding conjecture for Steiner triple systems
A hypertree is a $3$ -uniform hypergraph in which every two vertices are connected by a unique path. A Steiner triple system is a $3$ -uniform hypergraph in which every pair of verti…
openhypergraph-embeddings hypertrees steiner-triple-systems
0 responses
010

Elliott–Rödl's hypertree embedding conjecture for Steiner triple systems