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 3 of 3 for “"asymptotic enumeration"”.
-
Extremal problems in pseudo-random graphs and asymptotic enumeration
… maximum degree even after an adversary removes asymptotically half of the edges in G(n,p). Given an arbitrary graph H, we say that a graph G is H-free if G does not contain H as a subgraph. Edros, Frankl, and Rodl generalized a famous theorem of Erdos and Stone by proving that for every …
-
Exact and asymptotic enumeration of permutations with subsequence conditions
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1997.
-
Enumeration Results On Leaf Labeled Trees
<p>ENUMERATION RESULTS ON LEAF LABELED TREES,Virginia P. Johnson In evolutionary biology, it is common practice to represent the evolution of species, populations, and organisms with graphs, called phylogenetic or species trees. These are rooted leaf-labeled trees where non-root internal vertices …