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 “"pseudo-random graphs"”.
-
Extremal problems in pseudo-random graphs and asymptotic enumeration
… in extremal graph theory and the theory of random graphs. It consists of three more or less independent parts that all fit into one bigger picture -- the meta-problem of describing the structure and properties of large random and pseudo-random graphs. Given a positive constant c, we call an …
-
Extremal Problems for Cycles, Paths and Set-Systems
… extremal questions regarding cycles. Cycles in graphs are one of the most natural and basic structures to study. In particular, in the context of extremal problems, questions regarding their appearance and their count has always been of a significant interest. In Chapter 2 we study the Turán …