Hlinˇ en´ y:On matroid properties definable in the MSO logic, 27th International Symposium on Mathematical Foundations of Computer Science, MFCS (2003), 470–479

· 2003

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

math.CO · 2026-04-19 · unverdicted · novelty 7.0

Any spanning tree of the n x n grid has fundamental cycles with average length Omega(log n), and the bound is tight.

Showing 1 of 1 citing paper.

Fundamental cycles in grid graphs math.CO · 2026-04-19 · unverdicted · none · ref 29
Any spanning tree of the n x n grid has fundamental cycles with average length Omega(log n), and the bound is tight.