Hypertree shrinking avoiding low degree vertices
Hypertree shrinking avoiding low degree vertices
The shrinking operation converts a hypergraph into a graph by choosing, from each hyperedge, two endvertices of a corresponding graph edge. A hypertree is a hypergraph which can be shrunk to a tree on the same vertex set. Klimo\v{s}ov\'{a} and Thomass\'{e} [J. Combin. Theory Ser. B 156 (2022), 250--293] proved …