Login / Signup

Every Steiner Triple System Contains Almost Spanning $d$-Ary Hypertree.

Andrii ArmanVojtech RödlMarcelo Tadeu Sales
Published in: Electron. J. Comb. (2022)
Keyphrases
  • hypertree decomposition
  • steiner tree
  • relational databases
  • minimum spanning tree
  • upper bound