Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 1 of 1 for “"polya counting"”.
-
Bounding the Number of Graphs Containing Very Long Induced Paths
… Using this representation and the techniques of Polya counting we will then be able to get upper and lower bounds for graphs containing a long path as an induced subgraph. <p>In particular, if we let P(n,k) be the number of graphs on n+k vertices which contains P_n, a path on n vertices, as an …