Pith. sign in

Title resolution pending

Noga Alon, Spanning trees in regular graphs, Random Structures in Algorithms, 1 ( · 1990

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

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

math.CO 1

years

2024 1

verdicts

CONDITIONAL 1

representative citing papers

Spanning trees and continued fractions

math.CO · 2024-11-27 · conditional · novelty 7.0

The set of spanning tree numbers of connected planar simple graphs on n vertices has size at least c^n for some c>1, for all large n.

citing papers explorer

Showing 1 of 1 citing paper.

  • Spanning trees and continued fractions math.CO · 2024-11-27 · conditional · none · ref 1

    The set of spanning tree numbers of connected planar simple graphs on n vertices has size at least c^n for some c>1, for all large n.