Any spanning tree of the n x n grid has fundamental cycles with average length Omega(log n), and the bound is tight.
Seese:Linear time computable problems and first-order descriptions, Mathematical Structures in Computer Science6(1996), 505–526
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fundamental cycles in grid graphs
Any spanning tree of the n x n grid has fundamental cycles with average length Omega(log n), and the bound is tight.