"False"
Skip to content
umu.se
For students
Library
For staff
Login
Students
View your schedule and courses
Edit
Edit content at umu.se
Svensk webbplats
Search
Menu
X close menu
Menu
Search
Search within:
Search within:
All
Education
Research
Staff
Student web
News
Staff web
Other search services
Find courses and programmes
Library search tool
Search the legal framework
Main menu hidden.
Login
Students
View your schedule and courses
Edit
Edit content at umu.se
Svenska
Klas Markström
Contact
E-mail
klas.markstrom@umu.se
Phone
+46 90 786 97 21
Works at
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å
Presentation
Presentation
Publications
Publications
Research
Research
Mentions
Mentions
Personal webpage
2023
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.
2022
Avoiding and Extending Partial Edge Colorings of Hypercubes
Graphs and Combinatorics
, Springer 2022, Vol. 38, (3)
Casselgren, Carl Johan; Johansson, Per; Markström, Klas
2022
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
2021
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
2021
Biased random
k
-SAT
Random structures & algorithms (Print)
, John Wiley & Sons 2021, Vol. 59, (2) : 238-266
Larsson, Joel; Markström, Klas
2021
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
2020
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
2020
Restricted extension of sparse partial edge colorings of hypercubes
Discrete Mathematics
, Vol. 343, (11)
Casselgren, Carl Johan; Markström, Klas; Pham, Lan Anh
2020
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
2020
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.
2020
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.
2019
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
2019
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
2019
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.
2019
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
2018
Full subgraphs
Journal of Graph Theory
, Vol. 88, (3) : 411-427
Falgas-Ravry, Victor; Markström, Klas; Verstraëte, Jacques
2017
From the ising and potts models to the general graph homomorphism polynomial
Graph polynomials
, CRC Press 2017 : 123-138
Markström, Klas
2016
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.
2016
Random subcube intersection graphs I: cliques and covering
The Electronic Journal of Combinatorics
, Vol. 23, (3)
Falgas-Ravry, Victor; Markström, Klas
2016
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
2015
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.
2015
F-Factors in Hypergraphs Via Absorption
Graphs and Combinatorics
, Vol. 31, (3) : 679-712
Lo, Allan; Markström, Klas
2015
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
2015
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
2014
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
2014
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
2014
Perfect matchings in 3-partite 3-uniform hypergraphs
Journal of combinatorial theory. Series A (Print)
, Vol. 127 : 22-57
Lo, Allan; Markström, Klas
2014
l-Degree Turan Density
SIAM Journal on Discrete Mathematics
, Vol. 28, (3) : 1214-1225
Lo, Allan; Markström, Klas
2014
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
2014
Two Questions of Erdos on Hypergraphs above the Turan Threshold
Journal of Graph Theory
, Vol. 76, (2) : 101-105
Markström, Klas
2014
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.
2013
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.
2013
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
2013
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
2013
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
2013
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
2012
Random Latin square graphs
Random structures & algorithms (Print)
, Vol. 41, (1) : 47-65
Christofides, Demetres; Markström, Klas
2012
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
2012
Even cycle decompositions of 4-regular graphs and line graphs
Discrete Mathematics
, Amsterdam: 2012, Vol. 312, (17) : 2676-2681
Markström, Klas
2011
The guessing number of undirected graph
The Electronic Journal of Combinatorics
, Atlanta, Ga.: N.J. Calkin and H.S. Wilf 2011, Vol. 18, (1) : P192-
Christofides, Demetres; Markström, Klas
2011
Non-vanishing boundary effects and quasi-first-order phase transitions in high dimensional Ising models
Nuclear Physics B
, Amsterdam: Elsevier 2011, Vol. 845, (1) : 120-139
Lundow, P. H.; Markström, Klas
2011
Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
European journal of combinatorics (Print)
, London: Elsevier 2011, Vol. 32, (5) : 677-687
Markström, Klas; Rucinski, Andrzej
2011
Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree
Graphs and Combinatorics
, Tokyo: Springer-Verlag Tokyo Inc. 2011, Vol. 27, (2) : 243-249
Markström, Klas; Thomason, Andrew; Wagner, Peter
2010
The 1-vertex transfer matrix and accurate estimation of channel capacity
IEEE Transactions on Information Theory
, IEEE 2010, Vol. 57, (8) : 3692-3699
Friedland, S.; Lundow, P. H.; Markström, Klas
2010
Quantum bose-hubbard model with an evolving graph as a toy model for emergent spacetime
Physical Review D. Particles and fields
, APS 2010, Vol. 81, (10) : 104032-22 pages
Hamma, Alioscia; Markopoulou, Fotini; Lloyd, Seth; et al.
2010
Factors of r-partite graphs and bounds for the strong chromatic number
Ars combinatoria
, Charles Babbage Research Center 2010, Vol. 95 : 277-287
Johansson, Anders; Johansson, Robert; Markström, Klas
2010
Closure properties and negatively associated measures violating the Van Den Berg-Kesten inequality
Electronic Communications in Probability
, Institute of Mathematical Statistics 2010, Vol. 15 : 449-456
Markström, Klas
2010
On the density of 2-colorable 3-graphs in which any four points span at most two edges
Journal of combinatorial designs (Print)
, Vol. 18, (2) : 105-114
Markström, Klas; Talbot, John
2010
Aperiodic non-isomorphic lattices with equivalent percolation and random-cluster models
The Electronic Journal of Combinatorics
, Vol. 17, (1)
Markström, Klas; Wierman, John C.
2010
Unavoidable arrays
Contributions to Discrete Mathematics
, Vol. 5, (1) : 90-106
Markström, Klas; Öhman, Lars-Daniel
View publications in DiVA
Research groups
Members
Discrete Mathematics
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
Published: 25 Jun, 2018
The electoral system decides the winner
+ Show more
- Show less