Search for dissertations about: "Ramsey number"
Found 2 swedish dissertations containing the words Ramsey number.
-
1. On linear graph invariants related to Ramsey and edge numbers : or how I learned to stop worrying and love the alien invasion
Abstract : In this thesis we study the Ramsey numbers, R(l,k), the edge numbers, e(l,k;n) and graphs that are related to these. The edge number e(l,k;n) may be defined as the least natural number m for which all graphs on n vertices and less than m edges either contains a complete subgraph of size l or an independent set of size k. READ MORE
-
2. On minimal triangle-free Ramsey graphs
Abstract : A graph G is called a minimal Ramsey (3, k; n)-graph if it has the least amount of edges, e(3, k; n), possible given that G is triangle-free, has independence number α(G) < k an has n vertices. The numbers e(3, k; n) and the minimalRamsey graphs are directly related to the Ramsey numbers R(3, k). READ MORE