Byu Scholarsarchivemetadata only
Bounding the Number of Graphs Containing Very Long Induced Paths
mathematics, combinatorics, graph theory, paths, induced paths, asymptotic behavior, stirling numbers, polya counting
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 640203
Conceptio Open Knowledge Archive — every document is proof-bundled with source, license, and retrieval metadata.