Craig Tennenhouse

Learn More
For a family F of graphs, a graph G is F-saturated if G contains no member of F as a subgraph, but for any edge uv in G, G + uv contains some member of F as a subgraph. The minimum number of edges in an F-saturated graph of order n is denoted sat(n, F). A subdivision of a graph H, or an H-subdivision, is a graph G obtained from H by replacing the edges of H(More)
Extremal Graph Theory is the particular subfield of Graph Theory concerned with maximizing and minimizing certain parameters associated with graphs and digraphs. Beginning with Mantel [46] and Ramsey [52], the study of extremal graphs was extended by Turán [56] into edge-maximum clique free graphs. Similar problems, particularly those in this thesis, are(More)
  • 1