Klas Markström

Klas Markström is a Professor at the Department of Mathematics and Mathematical Statistics, Umeå University. He holds academic qualifications as a Docent and a Recognised University Teacher in Mathematics. His primary research interests include combinatorics, graph theory, hypergraphs, computational combinatorics, linear algebra, and mathematical physics. He utilizes Swedish supercomputing resources, including those at HPC2N, for his research.

Markström has advised PhD students Lan Anh Pham (2019) and Joel Larsson (2018). His postdoctoral collaborators include Jakub Sliacan, Fei Song, and Victor Falgas-Ravry. His work spans theoretical contributions to combinatorics, computational methods, and applications in statistical mechanics and algorithm design.

Notable research trends include explorations of Condorcet domains in social choice theory, extremal graph/hypergraph problems, and algorithmic solutions for SAT problems. His software contributions include the Umsat SAT-solver and GrafPack, a Mathematica package for graph theory. He has published extensively on topics such as Turán hypergraphs, covering designs, and computational techniques for graph enumeration.

Collaborations involve interdisciplinary projects with physicists and computer scientists, reflecting his engagement with both pure and applied mathematics. His research often bridges combinatorial theory with computational experimentation, yielding impactful results in discrete mathematics and beyond.