Search for dissertations about: "Klas Markström"
Showing result 1 - 5 of 8 swedish dissertations containing the words Klas Markström.
-
1. On random cover and matching problems
Abstract : This thesis consists of the following papers.I J. Larsson, The Minimum Matching in Pseudo-dimension 0 < q < 1, submittedII V. Falgas-Ravry, J. READ MORE
-
2. Building and Destroying Urns, Graphs, and Trees
Abstract : In this thesis, consisting of an introduction and four papers, different models in the mathematical area of combinatorial probability are investigated.In Paper I, two operations for combining generalised Pólya urns, called disjoint union and product, are defined. READ MORE
-
3. Snarks : Generation, coverings and colourings
Abstract : For a number of unsolved problems in graph theory such as the cycle double cover conjecture, Fulkerson's conjecture and Tutte's 5-flow conjecture it is sufficient to prove them for a family of graphs called snarks. Named after the mysterious creature in Lewis Carroll's poem, a \emph{snark} is a cyclically 4-edge connected 3-regular graph of girth at least 5 which cannot be properly edge coloured using three colours. READ MORE
-
4. 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
-
5. On random satisfiability and optimization problems
Abstract : In Paper I, we study the following optimization problem: in the complete bipartite graph where edges are given i.i.d. weights of pseudo-dimension q>0, find a perfect matching with minimal total weight. READ MORE