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 “"Extremalproblem"”.
-
Eindeutige Faktoren von Graphen - maximale Kantenzahlen und Extremalgraphen
We are given a set V of vertices and a class of graphs on V. In this paper we examine the following question: What is the maximum number of edges in a graph on V, which contains exactly one graph of the class as a subgraph? What can we say about the corresponding extremal graphs? In this thesis we …