Skip to main content

Questions tagged [spanning-tree]

Filter by
Sorted by
Tagged with
19 votes
4 answers
1k views

Minimal graphs with a prescribed number of spanning trees

As it's long ago since Erdős died and MathOverflow is the second best alternative to him (for discussing personal problems), I'd like to start a fruitful discussion about the following problem that I ...
Jernej's user avatar
  • 3,463
15 votes
0 answers
591 views

On some special spanning trees of grid graphs

I would like to know if there are existing results on the following objects: spanning trees of a grid graph, with no corridor where a corridor is a vertex having exactly two neighbors, on opposite ...
F. C.'s user avatar
  • 3,587
12 votes
4 answers
1k views

Graphs in which every spanning tree is an independency tree

It follows from this question and the corresponding answers, that the complete graphs and the cycles are precisely the graphs $G$ having the property that, for every spanning tree $T$ of $G$, the ...
vb le's user avatar
  • 323
5 votes
0 answers
213 views

Euclidean Minimum Spanning Trees Restricted to One Vertex Per Grid Cell

Given an $n \times n$ grid with unit grid cells, and one point from the interior of each cell, what is are best possible lower and upper bounds for lengths of minimum spanning trees? The lower bound ...
user avatar
4 votes
0 answers
240 views

Does the zeta regularized Laplacian determinant measure the volume of some parameter space? How many "spanning trees" on a manifold?

Let $(M,g)$ be a Riemannian manifold, with Laplacian $\Delta$. If $\lambda_i$ are the nonzero eigenvalues of $\Delta$, we can define the zeta function $\zeta(s) = \Sigma \lambda_i^{-s}$. By analytic ...
Elle Najt's user avatar
  • 1,462