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 2 of 2 for “"Random colouring"”.
-
The Ramsey multiplicity problem
… copies of H is asymptotically minimized by a random colouring. It is well known that the disjoint union of two common graphs may be uncommon; e.g., K_2 and K_3 are common, but their disjoint union is not. In Chapter 3, we investigate the commonality of disjoint unions of multiple copies of K_3 …
-
Τυχαίες συνδυαστικές δομές
… For given n,m,p we investigate if an instance of random intersection graph G (n,m,p) contains or not a Hamilton cycle. We assume that the parameter p of the model is such that p=p (n,m). We show that for the range of n,m,p which the model is not trivial or equivalent to other models the graph …