Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
1 answer
105 views

"Spanning trees" for connected linear hypergraphs

Starting point. For every simple, undirected graph $G=(V,E)$ there is $E_0\subseteq E$ such that $(V,E_0)$ is minimally connected: the spanning tree. The goal of this question is to find out whether ...
Dominic van der Zypen's user avatar