Right now you are surfing a limited version of umu.se. What does this mean?

"False"
Umeå University
printicon
Main menu hidden.
Staff photo Klas Markström

Klas Markström

Research qualifications: Docent
Educational qualifications: Recognised university teacher

Contact

E-mail
klas.markstrom@umu.se
Phone
+46 90 786 97 21

Works as

Affiliation
Professor at Department of Mathematics and Mathematical Statistics
Location
MIT-huset, plan 3, Matematik och matematisk statistik, MIT.D.340 Umeå universitet, 901 87 Umeå
Near triple arrays
Journal of combinatorial theory. Series A (Print), Elsevier 2026, Vol. 219
Gordeev, Alexey; Markström, Klas; Öhman, Lars-Daniel
Condorcet domains on at most seven alternatives
Mathematical Social Sciences, Elsevier 2025, Vol. 133 : 23-33
Akello-Egwel, Dolica; Leedham-Green, Charles; Litterick, Alastair; et al.
Enumeration and construction of row-column designs
Journal of combinatorial designs (Print), John Wiley & Sons 2025, Vol. 33, (9) : 357-372
Jäger, Gerold; Markström, Klas; Shcherbak, Denys; et al.
Coherent domains and improved lower bounds for the maximum size of Condorcet domains
Discrete Applied Mathematics, Vol. 370 : 57-70
Karpov, Alexander; Markström, Klas; Riis, Søren; et al.
Minimum-degree conditions for rainbow triangles
Journal of Graph Theory, John Wiley & Sons 2024, Vol. 107, (2) : 298-329
Falgas-Ravry, Victor; Markström, Klas; Räty, Eero
Rainbow variations on a theme by mantel: extremal problems for Gallai colouring templates
Combinatorica, Springer Nature 2024, Vol. 44 : 997-1010
Falgas-Ravry, Victor; Markström, Klas; Räty, Eero
Enumeration of sets of mutually orthogonal latin rectangles
The Electronic Journal of Combinatorics, Australian National University Press 2024, Vol. 31, (1)
Jäger, Gerold; Öhman, Lars-Daniel; Markström, Klas; et al.
The largest Condorcet domain on 8 alternatives
Social Choice and Welfare, Springer Science+Business Media B.V. 2024, Vol. 62, (1) : 109-116
Leedham-Green, Charles; Markström, Klas; Riis, Søren
CDL: A fast and flexible library for the study of permutation sets with structural restrictions
SoftwareX, Elsevier 2024, Vol. 28
Zhou, Bei; Markström, Klas; Riis, Søren
Polarised random κ-SAT
Combinatorics, probability & computing, Cambridge University Press 2023, Vol. 32, (6) : 885-899
Danielsson, Joel Larsson; Markström, Klas
Small youden rectangles, near youden rectangles, and their connections to other row-column designs
Discrete Mathematics & Theoretical Computer Science, Centre pour la Communication Scientifique Directe (CCSD) 2023, Vol. 25, (1)
Jäger, Gerold; Markström, Klas; Shcherbak, Denys; et al.
Revising the universality class of the four-dimensional Ising model
Nuclear Physics B, Vol. 993
Lundow, Per-Håkan; Markström, Klas
Avoiding and Extending Partial Edge Colorings of Hypercubes
Graphs and Combinatorics, Springer 2022, Vol. 38, (3)
Casselgren, Carl Johan; Johansson, Per; Markström, Klas
Efficient computation of permanents, with applications to Boson sampling and random matrices
Journal of Computational Physics, Academia Press 2022, Vol. 455
Lundow, Per-Håkan; Markström, Klas
Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
Combinatorics, probability & computing, Cambridges Institutes Press 2021, Vol. 30, (2) : 175-199
Falgas-Ravry, Victor; Markström, Klas; Zhao, Yi
Biased random k-SAT
Random structures & algorithms (Print), John Wiley & Sons 2021, Vol. 59, (2) : 238-266
Larsson, Joel; Markström, Klas
Partite Turán-densities for complete r-uniform hypergraphs on r + 1 vertices
Journal of Combinatorics, Vol. 12, (2) : 235-245
Markström, Klas; Thomassen, Carsten
Edge precoloring extension of hypercubes
Journal of Graph Theory, John Wiley & Sons 2020, Vol. 95, (3) : 410-444
Casselgren, Carl Johan; Markström, Klas; Pham, Lan Anh
Restricted extension of sparse partial edge colorings of hypercubes
Discrete Mathematics, Vol. 343, (11)
Casselgren, Carl Johan; Markström, Klas; Pham, Lan Anh
Speed and concentration of the covering time for structured coupon collectors
Advances in Applied Probability, Cambridge University Press 2020, Vol. 52, (2) : 433-462
Falgas-Ravry, Victor; Larsson, Joel; Markström, Klas
Existence thresholds and Ramsey properties of random posets
Random structures & algorithms (Print), John Wiley & Sons 2020, Vol. 57, (4) : 1097-1133
Falgas-Ravry, Victor; Markström, Klas; Treglown, Andrew; et al.
Discriminating nonisomorphic graphs with an experimental quantum annealer
Physical Review A: covering atomic, molecular, and optical physics and quantum information, American Physical Society 2020, Vol. 102, (3)
Izquierdo, Zoe Gonzalez; Zhou, Ruilin; Markström, Klas; et al.
Restricted completion of sparse partial Latin squares
Combinatorics, probability & computing, Cambridge University Press 2019, Vol. 28, (5) : 675-695
Andren, Lina J.; Casselgren, Carl Johan; Markström, Klas
Latin cubes with forbidden entries
The Electronic Journal of Combinatorics, Newark: Department of Mathematical Science, University of Delaware 2019, Vol. 26, (1)
Casselgren, Carl Johan; Markström, Klas; Pham, Lan Anh
Triples of Orthogonal Latin and Youden Rectangles of small order
Journal of combinatorial designs (Print), Vol. 27, (4) : 229-250
Jäger, Gerold; Markström, Klas; Öhman, Lars-Daniel; et al.
Revisiting the cavity-method threshold for random 3-SAT
Physical review. E, American Physical Society 2019, Vol. 99, (2)
Lundow, Per-Håkan; Markström, Klas
Full subgraphs
Journal of Graph Theory, Vol. 88, (3) : 411-427
Falgas-Ravry, Victor; Markström, Klas; Verstraëte, Jacques
From the ising and potts models to the general graph homomorphism polynomial
Graph polynomials, CRC Press 2017 : 123-138
Markström, Klas
On 1-sum flows in undirected graphs
The Electronic Journal of Linear Algebra, INT LINEAR ALGEBRA SOC 2016, Vol. 31 : 646-665
Akbari, Saieed; Friedland, Shmuel; Markström, Klas; et al.
Random subcube intersection graphs I: cliques and covering
The Electronic Journal of Combinatorics, Vol. 23, (3)
Falgas-Ravry, Victor; Markström, Klas
The scaling window of the 5D Ising model with free boundary conditions
Nuclear Physics B, Elsevier 2016, Vol. 911 : 163-172
Lundow, Per-Håkan; Markström, Klas
Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges
European journal of combinatorics (Print), Vol. 45 : 132-144
Aaghabali, M.; Akbari, S.; Friedland, S.; et al.
F-factors in hypergraphs via absorption
Graphs and Combinatorics, Springer Nature 2015, Vol. 31, (3) : 679-712
Lo, Allan; Markström, Klas
The discontinuity of the specific heat for the 5D Ising model
Nuclear Physics B, Vol. 895 : 305-318
Lundow, Per-Håkan; Markström, Klas
Complete graph asymptotics for the Ising and random-cluster models on five-dimensional grids with a cyclic boundary
Physical Review E. Statistical, Nonlinear, and Soft Matter Physics, American Physical Society 2015, Vol. 91
Lundow, Per-Håkan; Markström, Klas
The thresholds for diameter 2 in random Cayley graphs
Random structures & algorithms (Print), John Wiley & Sons 2014, Vol. 45, (2) : 218-235
Christofides, Demetres; Markström, Klas
The range of thresholds for diameter 2 in random Cayley graphs
European journal of combinatorics (Print), Vol. 35 : 141-154
Christofides, Demetres; Markström, Klas
Perfect matchings in 3-partite 3-uniform hypergraphs
Journal of combinatorial theory. Series A (Print), Vol. 127 : 22-57
Lo, Allan; Markström, Klas
l-Degree Turan Density
SIAM Journal on Discrete Mathematics, Vol. 28, (3) : 1214-1225
Lo, Allan; Markström, Klas
Finite size scaling of the 5D Ising model with free boundary conditions
Nuclear Physics B, Vol. 889 : 249-260
Lundow, Per-Håkan; Markström, Klas
Two Questions of Erdos on Hypergraphs above the Turan Threshold
Journal of Graph Theory, Vol. 76, (2) : 101-105
Markström, Klas
Hearing the shape of the Ising model with a programmable superconducting-flux annealer
Scientific Reports, Nature Publishing Group 2014, Vol. 4 : 5703-
Vinci, Walter; Markström, Klas; Boixo, Sergio; et al.
Generation and properties of snarks
Journal of combinatorial theory. Series B (Print), Vol. 103, (4) : 468-488
Brinkmann, Gunnar; Goedgebeur, Jan; Hägglund, Jonas; et al.
Shortest cycle covers and cycle double covers with large 2-regular subgraphs
Journal of Combinatorics, Vol. 4, (4) : 457-468
Hägglund, Jonas; Markström, Klas
Turán and Ramsey properties of subcube intersection graphs
Combinatorics, probability & computing, New York, NY, USA: Cambridge University Press 2013, Vol. 22, (1) : 55-70
Johnson, J. Robert; Markström, Klas
Minimum codegree threshold for (K-4(3)-e)-factors
Journal of combinatorial theory. Series A (Print), Vol. 120, (3) : 708-721
Lo, Allan; Markström, Klas
A multipartite version of the Hajnal-Szemerédi theorem for graphs and hypergraphs
Combinatorics, probability & computing, New York, NJ, USA: Cambridge University Press 2013, Vol. 22, (1) : 97-111
Lo, Allan; Markström, Klas
Random Latin square graphs
Random structures & algorithms (Print), Vol. 41, (1) : 47-65
Christofides, Demetres; Markström, Klas
On stable cycles and cycle double covers of graphs with large circumference
Discrete Mathematics, Elsevier 2012, Vol. 312, (17) : 2540-2544
Hägglund, Jonas; Markström, Klas
Even cycle decompositions of 4-regular graphs and line graphs
Discrete Mathematics, Amsterdam: 2012, Vol. 312, (17) : 2676-2681
Markström, Klas
View publications in DiVA

Research groups

Members
Computational combinatorics and optimization
Members
Discrete Mathematics
Members
Extremal and probabilistic combinatorics

Research projects

1 January 2016 until 31 December 2020
Three and four-dimensional tera-spin systems
1 January 2014 until 31 December 2018
Complex relations, graphs and hypergraphs
19 May 2008 until 31 December 2009
Graph theory and algorithms