2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/125070This paper is devoted to one theory of hypergraph connectivity and presents the proof of the polynomial algorithm for finding an optimal spanning hyperforest(hypertree) for any given weighed q-uniform hypergraph.7 pages, 2 figuresCombinatorics05C65text