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 “"Sparse random graphs"”.

  1. Probabilistic and Analytic Methods in Combinatorics

    … advances within design theory and the theory of random processes. The third and fourth chapters of this thesis consider problems within random matrix theory; in particular on problems regarding sparse random graphs. The third chapter concerns a question of Vu regarding the singularity of the …

    mit Repository record for Probabilistic and Analytic Methods in Combinatorics (opens in a new tab)

  2. 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 …

    cambridge Repository record for Extremal Problems for Cycles, Paths and Set-Systems (opens in a new tab)