User:Jan Winnicki/Maximum internal spanning tree

Given a connected, undirected graph, a maximum internal spanning tree (MaxIST) of that graph is a spanning tree that maximizes the number of internal vertices among all of its spanning trees.