Klas Markström

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 34

Top Topics

Hypertree Decomposition

Top Venues

J. Graph Theory

Electron. J. Comb.

Random Struct. Algorithms

Publications

Klas Markström, Søren Riis, Bei Zhou
Arrow's single peaked domains, richness, and domains for plurality and the Borda count. CoRR (2024)
Charles R. Leedham-Green, Klas Markström, Søren Riis
The largest Condorcet domain on 8 alternatives. Soc. Choice Welf. 62 (1) (2024)
Alexander Karpov, Klas Markström, Søren Riis, Bei Zhou
Local Diversity of Condorcet Domains. CoRR (2024)
Gerold Jäger, Klas Markström, Lars-Daniel Öhman, Denys Shcherbak
Enumeration of Row-Column Designs. CoRR (2024)
Gerold Jäger, Klas Markström, Lars-Daniel Öhman, Denys Shcherbak
Enumeration of Sets of Mutually Orthogonal Latin Rectangles. Electron. J. Comb. 31 (1) (2024)
Victor Falgas-Ravry, Klas Markström, Eero Räty
Minimum degree conditions for rainbow triangles. CoRR (2023)
Bei Zhou, Klas Markström, Søren Riis
CDL: A fast and flexible library for the study of permutation sets with structural restrictions. CoRR (2023)
Joel Larsson Danielsson, Klas Markström
Polarised random -SAT. Comb. Probab. Comput. 32 (6) (2023)
Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman
Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs. Discret. Math. Theor. Comput. Sci. 25 (2023)
Alexander Karpov, Klas Markström, Søren Riis, Bei Zhou
Set-alternating schemes: A new class of large Condorcet domains. CoRR (2023)
Dolica Akello-Egwell, Charles R. Leedham-Green, Alastair Litterick, Klas Markström, Søren Riis
Condorcet Domains of Degree at most Seven. CoRR (2023)
Victor Falgas-Ravry, Klas Markström, Eero Räty
Rainbow variations on a theme by Mantel: extremal problems for Gallai colouring templates. CoRR (2022)
Per Håkan Lundow, Klas Markström
Efficient computation of permanents, with applications to Boson sampling and random matrices. J. Comput. Phys. 455 (2022)
Carl Johan Casselgren, Per Johansson, Klas Markström
Avoiding and Extending Partial Edge Colorings of Hypercubes. Graphs Comb. 38 (3) (2022)
Joel Larsson, Klas Markström
Biased random k-SAT. Random Struct. Algorithms 59 (2) (2021)
Victor Falgas-Ravry, Klas Markström, Andrew Treglown, Yi Zhao
Existence thresholds and Ramsey properties of random posets. Random Struct. Algorithms 57 (4) (2020)
Carl Johan Casselgren, Klas Markström, Lan Anh Pham
Restricted extension of sparse partial edge colorings of hypercubes. Discret. Math. 343 (11) (2020)
Carl Johan Casselgren, Klas Markström, Lan Anh Pham
Edge precoloring extension of hypercubes. J. Graph Theory 95 (3) (2020)
Lina Jansson Andrén, Carl Johan Casselgren, Klas Markström
Restricted completion of sparse partial Latin squares. Comb. Probab. Comput. 28 (5) (2019)
Carl Johan Casselgren, Klas Markström, Lan Anh Pham
Latin Cubes with Forbidden Entries. Electron. J. Comb. 26 (1) (2019)
Klas Markström, Carsten Thomassen
Partite Turán-densities for complete r-uniform hypergraphs on r+1 vertices. CoRR (2019)
Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman
Enumeration of Sets of Mutually Orthogonal Latin Rectangles. CoRR (2019)
Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman
Small Youden Rectangles and Their Connections to Other Row-Column Designs. CoRR (2019)
Victor Falgas-Ravry, Klas Markström, Yi Zhao
Triangle-degrees in graphs and tetrahedron coverings in 3-graphs. CoRR (2019)
Gerold Jäger, Klas Markström, Lars-Daniel Öhman, Denys Shcherbak
Triples of Orthogonal Latin and Youden Rectangles For Small Orders. CoRR (2018)
Victor Falgas-Ravry, Klas Markström, Jacques Verstraëte
Full subgraphs. J. Graph Theory 88 (3) (2018)
Lina Jansson Andrén, Carl Johan Casselgren, Klas Markström
Restricted completion of sparse partial Latin squares. CoRR (2016)
Victor Falgas-Ravry, Joel Larsson, Klas Markström
Speed and concentration of the covering time for structured coupon collectors. CoRR (2016)
Victor Falgas-Ravry, Klas Markström
Random Subcube Intersection Graphs I: Cliques and Covering. Electron. J. Comb. 23 (3) (2016)
Allan Lo, Klas Markström
F-Factors in Hypergraphs Via Absorption. Graphs Comb. 31 (3) (2015)
Klas Markström
The Straight Line Complexity of Small Factorials and Primorials. Integers 15 (2015)
Victor Falgas-Ravry, Klas Markström, Jacques Verstraëte
Full subgraphs. CoRR (2015)
M. Aghabali, Saieed Akbari, Shmuel Friedland, Klas Markström, Zakeieh Tajfirouz
Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges. Eur. J. Comb. 45 (2015)
Klas Markström
Problem collection from the IML programme: Graphs, Hypergraphs, and Computing. CoRR (2015)
Allan Lo, Klas Markström
Perfect matchings in 3-partite 3-uniform hypergraphs. J. Comb. Theory, Ser. A 127 (2014)
Klas Markström
Two Questions of Erdős on Hypergraphs above the Turán Threshold. J. Graph Theory 76 (2) (2014)
Allan Lo, Klas Markström
ℓ-Degree Turán Density. SIAM J. Discret. Math. 28 (3) (2014)
Klas Markström
The general graph homomorphism polynomial: Its relationship with other graph polynomials and partition functions. CoRR (2014)
Demetres Christofides, Klas Markström
The thresholds for diameter 2 in random Cayley graphs. Random Struct. Algorithms 45 (2) (2014)
Demetres Christofides, Klas Markström
The range of thresholds for diameter 2 in random Cayley graphs. Eur. J. Comb. 35 (2014)
J. Robert Johnson, Klas Markström
Turán and Ramsey Properties of Subcube Intersection Graphs. Comb. Probab. Comput. 22 (1) (2013)
Gunnar Brinkmann, Jan Goedgebeur, Jonas Hägglund, Klas Markström
Generation and properties of snarks. J. Comb. Theory, Ser. B 103 (4) (2013)
Klas Markström
Improved bounds for the shortness coefficient of cyclically 4-edge connected cubic graphs and snarks. CoRR (2013)
Allan Lo, Klas Markström
A Multipartite Version of the Hajnal-Szemerédi Theorem for Graphs and Hypergraphs. Comb. Probab. Comput. 22 (1) (2013)
Allan Lo, Klas Markström
Minimum codegree threshold for -factors. J. Comb. Theory, Ser. A 120 (3) (2013)
Jonas Hägglund, Klas Markström
Shortest cycle covers and cycle double covers with large 2-regular subgraphs. CoRR (2013)
Klas Markström
The straight line complexity of small factorials and primorials. CoRR (2013)
Jonas Hägglund, Klas Markström
On stable cycles and cycle double covers of graphs with large circumference. Discret. Math. 312 (17) (2012)
Klas Markström
Even cycle decompositions of 4-regular graphs and line graphs. Discret. Math. 312 (17) (2012)
Gunnar Brinkmann, Jan Goedgebeur, Jonas Hägglund, Klas Markström
Generation and Properties of Snarks CoRR (2012)
Demetres Christofides, Klas Markström
Random Latin square graphs. Random Struct. Algorithms 41 (1) (2012)
Klas Markström, Andrzej Rucinski
Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees. Eur. J. Comb. 32 (5) (2011)
Klas Markström
Two questions of Erdős on hypergraphs above the Turán threshold. CoRR (2011)
Demetres Christofides, Klas Markström
The Guessing Number of Undirected Graphs. Electron. J. Comb. 18 (1) (2011)
Klas Markström, Andrew Thomason, Peter Wagner
Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree. Graphs Comb. 27 (2) (2011)
Anders Johansson, Robert Johansson, Klas Markström
Factors of r-partite graphs and bounds for the Strong Chromatic Number. Ars Comb. 95 (2010)
Klas Markström, Lars-Daniel Öhman
Unavoidable arrays. Contributions Discret. Math. 5 (1) (2010)
Klas Markström, John C. Wierman
Aperiodic Non-Isomorphic Lattices with Equivalent Percolation and Random-Cluster Models. Electron. J. Comb. 17 (1) (2010)
Shmuel Friedland, Per Håkan Lundow, Klas Markström
The 1-vertex transfer matrix and accurate estimation of channel capacity. IEEE Trans. Inf. Theory 56 (8) (2010)
Klas Markström
A note on uniquely pancyclic graphs. Australas. J Comb. 44 (2009)
Klas Markström
. Discret. Math. 309 (16) (2009)
Daniel Andrén, Klas Markström
The bivariate Ising polynomial of a graph. Discret. Appl. Math. 157 (11) (2009)
Daniel Andrén, Lars Hellström, Klas Markström
Fast multiplication of matrices over a finitely generated semiring. Inf. Process. Lett. 107 (6) (2008)
Demetres Christofides, Klas Markström
Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales. Random Struct. Algorithms 32 (1) (2008)
Shmuel Friedland, Elliot Krop, Klas Markström
On the Number of Matchings in Regular Graphs. Electron. J. Comb. 15 (1) (2008)
Per Håkan Lundow, Klas Markström
Exact and Approximate Compression of Transfer Matrices for Graph Homomorphisms. LMS J. Comput. Math. 11 (2008)
Daniel Andrén, Lars Hellström, Klas Markström
On the complexity of matrix reduction over finite fields. Adv. Appl. Math. 39 (4) (2007)
Per Håkan Lundow, Klas Markström
Broken-Cycle-Free Subgraphs and the Log-Concavity Conjecture for Chromatic Polynomials. Exp. Math. 15 (3) (2006)
Roland Häggkvist, Klas Markström
Cycle double covers and spanning minors II. Discret. Math. 306 (8-9) (2006)
Klas Markström
Locality and Hard SAT-Instances. J. Satisf. Boolean Model. Comput. 2 (1-4) (2006)
Imre Leader, Klas Markström
Uncountable families of vertex-transitive graphs of finite degree. Discret. Math. 306 (7) (2006)
Roland Häggkvist, Klas Markström
Cycle double covers and spanning minors I. J. Comb. Theory, Ser. B 96 (2) (2006)
Klas Markström
Complete Minors in Cubic Graphs with few short Cycles and Random Cubic Graphs. Ars Comb. 70 (2004)