Complete Minors in Cubic Graphs with few short Cycles and Random Cubic Graphs. - Klas Markström (Ars Comb., 2004)

Cycle double covers and spanning minors II. - Roland Häggkvist; Klas Markström (Discret. Math., 2006)

Uncountable families of vertex-transitive graphs of finite degree. - Imre Leader; Klas Markström (Discret. Math., 2006)

Broken-Cycle-Free Subgraphs and the Log-Concavity Conjecture for Chromatic Polynomials. - Per Håkan Lundow; Klas Markström (Exp. Math., 2006)

Cycle double covers and spanning minors I. - Roland Häggkvist; Klas Markström (J. Comb. Theory B, 2006)

Locality and Hard SAT-Instances. - Klas Markström (J. Satisf. Boolean Model. Comput., 2006)

On the complexity of matrix reduction over finite fields. - Daniel Andrén; Lars Hellström; Klas Markström (Adv. Appl. Math., 2007)

On the Number of Matchings in Regular Graphs. - Shmuel Friedland; Elliot Krop; Klas Markström (Electron. J. Comb., 2008)

Fast multiplication of matrices over a finitely generated semiring. - Daniel Andrén; Lars Hellström; Klas Markström (Inf. Process. Lett., 2008)

Exact and Approximate Compression of Transfer Matrices for Graph Homomorphisms. - Per Håkan Lundow; Klas Markström (LMS J. Comput. Math., 2008)

Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales. - Demetres Christofides; Klas Markström (Random Struct. Algorithms, 2008)

A note on uniquely pancyclic graphs. - Klas Markström (Australas. J Comb., 2009)

The bivariate Ising polynomial of a graph. - Daniel Andrén; Klas Markström (Discret. Appl. Math., 2009)

Extremal hypergraphs and bounds for the Turán density of the 4-uniform K5. - Klas Markström (Discret. Math., 2009)

Factors of r-partite graphs and bounds for the Strong Chromatic Number. - Anders Johansson; Robert Johansson; Klas Markström (Ars Comb., 2010)

Unavoidable arrays. - Klas Markström; Lars-Daniel Öhman (Contributions Discret. Math., 2010)

Aperiodic Non-Isomorphic Lattices with Equivalent Percolation and Random-Cluster Models. - Klas Markström; John C. Wierman (Electron. J. Comb., 2010)

The 1-vertex transfer matrix and accurate estimation of channel capacity. - Shmuel Friedland; Per Håkan Lundow; Klas Markström (IEEE Trans. Inf. Theory, 2010)

The Guessing Number of Undirected Graphs. - Demetres Christofides; Klas Markström (Electron. J. Comb., 2011)

Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees. - Klas Markström; Andrzej Rucinski 001 (Eur. J. Comb., 2011)

Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree. - Klas Markström; Andrew Thomason 001; Peter Wagner 002 (Graphs Comb., 2011)

On stable cycles and cycle double covers of graphs with large circumference. - Jonas Hägglund; Klas Markström (Discret. Math., 2012)

Even cycle decompositions of 4-regular graphs and line graphs. - Klas Markström (Discret. Math., 2012)

Random Latin square graphs. - Demetres Christofides; Klas Markström (Random Struct. Algorithms, 2012)

Shortest cycle covers and cycle double covers with large 2-regular subgraphs. - Jonas Hägglund; Klas Markström (CoRR, 2013)

Improved bounds for the shortness coefficient of cyclically 4-edge connected cubic graphs and snarks. - Klas Markström (CoRR, 2013)

Turán and Ramsey Properties of Subcube Intersection Graphs. - J. Robert Johnson; Klas Markström (Comb. Probab. Comput., 2013)

A Multipartite Version of the Hajnal-Szemerédi Theorem for Graphs and Hypergraphs. - Allan Lo; Klas Markström (Comb. Probab. Comput., 2013)

Generation and properties of snarks. - Gunnar Brinkmann; Jan Goedgebeur; Jonas Hägglund; Klas Markström (J. Comb. Theory B, 2013)

Minimum codegree threshold for -factors. - Allan Lo; Klas Markström (J. Comb. Theory A, 2013)

The general graph homomorphism polynomial: Its relationship with other graph polynomials and partition functions. - Klas Markström (CoRR, 2014)

The range of thresholds for diameter 2 in random Cayley graphs. - Demetres Christofides; Klas Markström (Eur. J. Comb., 2014)

Perfect matchings in 3-partite 3-uniform hypergraphs. - Allan Lo; Klas Markström (J. Comb. Theory A, 2014)

Two Questions of Erdős on Hypergraphs above the Turán Threshold. - Klas Markström (J. Graph Theory, 2014)

The thresholds for diameter 2 in random Cayley graphs. - Demetres Christofides; Klas Markström (Random Struct. Algorithms, 2014)

ℓ-Degree Turán Density. - Allan Lo; Klas Markström (SIAM J. Discret. Math., 2014)

Problem collection from the IML programme: Graphs, Hypergraphs, and Computing. - Klas Markström (CoRR, 2015)

Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges. - M. Aghabali; Saieed Akbari; Shmuel Friedland; Klas Markström; Zakeieh Tajfirouz (Eur. J. Comb., 2015)

F-Factors in Hypergraphs Via Absorption. - Allan Lo; Klas Markström (Graphs Comb., 2015)

The Straight Line Complexity of Small Factorials and Primorials. - Klas Markström (Integers, 2015)

Random Subcube Intersection Graphs I: Cliques and Covering. - Victor Falgas-Ravry; Klas Markström (Electron. J. Comb., 2016)

Speed and concentration of the covering time for structured coupon collectors. - Victor Falgas-Ravry; Joel Larsson; Klas Markström (CoRR, 2016)

Triples of Orthogonal Latin and Youden Rectangles For Small Orders. - Gerold Jäger; Klas Markström; Lars-Daniel Öhman; Denys Shcherbak (CoRR, 2018)

Full subgraphs. - Victor Falgas-Ravry; Klas Markström; Jacques Verstraëte (J. Graph Theory, 2018)

Latin Cubes with Forbidden Entries. - Carl Johan Casselgren; Klas Markström; Lan Anh Pham (Electron. J. Comb., 2019)

Triangle-degrees in graphs and tetrahedron coverings in 3-graphs. - Victor Falgas-Ravry; Klas Markström; Yi Zhao 005 (CoRR, 2019)

Partite Turán-densities for complete r-uniform hypergraphs on r+1 vertices. - Klas Markström; Carsten Thomassen (CoRR, 2019)

Small Youden Rectangles and Their Connections to Other Row-Column Designs. - Gerold Jäger; Klas Markström; Denys Shcherbak; Lars-Daniel Öhman (CoRR, 2019)

Restricted completion of sparse partial Latin squares. - Lina Jansson Andrén; Carl Johan Casselgren; Klas Markström (Comb. Probab. Comput., 2019)

Restricted extension of sparse partial edge colorings of hypercubes. - Carl Johan Casselgren; Klas Markström; Lan Anh Pham (Discret. Math., 2020)

Edge precoloring extension of hypercubes. - Carl Johan Casselgren; Klas Markström; Lan Anh Pham (J. Graph Theory, 2020)

Existence thresholds and Ramsey properties of random posets. - Victor Falgas-Ravry; Klas Markström; Andrew Treglown; Yi Zhao 005 (Random Struct. Algorithms, 2020)

Biased random k-SAT. - Joel Larsson; Klas Markström (Random Struct. Algorithms, 2021)

Avoiding and Extending Partial Edge Colorings of Hypercubes. - Carl Johan Casselgren; Per Johansson; Klas Markström (Graphs Comb., 2022)

Efficient computation of permanents, with applications to Boson sampling and random matrices. - Per Håkan Lundow; Klas Markström (J. Comput. Phys., 2022)

Condorcet Domains of Degree at most Seven. - Dolica Akello-Egwel; Charles R. Leedham-Green; Alastair Litterick; Klas Markström; Søren Riis (CoRR, 2023)

Set-alternating schemes: A new class of large Condorcet domains. - Alexander Karpov; Klas Markström; Søren Riis; Bei Zhou (CoRR, 2023)

Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs. - Gerold Jäger; Klas Markström; Denys Shcherbak; Lars-Daniel Öhman (Discret. Math. Theor. Comput. Sci., 2023)

Polarised random -SAT. - Joel Larsson Danielsson; Klas Markström (Comb. Probab. Comput., 2023)

Enumeration of Sets of Mutually Orthogonal Latin Rectangles. - Gerold Jäger; Klas Markström; Lars-Daniel Öhman; Denys Shcherbak (Electron. J. Comb., 2024)

Local Diversity of Condorcet Domains. - Alexander Karpov; Klas Markström; Søren Riis; Bei Zhou (CoRR, 2024)

Arrow's single peaked domains, richness, and domains for plurality and the Borda count. - Klas Markström; Søren Riis; Bei Zhou (CoRR, 2024)

Enumeration of Row-Column Designs. - Gerold Jäger; Klas Markström; Lars-Daniel Öhman; Denys Shcherbak (CoRR, 2024)

Minimum-degree conditions for rainbow triangles. - Victor Falgas-Ravry; Klas Markström; Eero Räty (J. Graph Theory, 2024)

CDL: A fast and flexible library for the study of permutation sets with structural restrictions. - Bei Zhou; Klas Markström; Søren Riis (SoftwareX, 2024)

The largest Condorcet domain on 8 alternatives. - Charles R. Leedham-Green; Klas Markström; Søren Riis (Soc. Choice Welf., 2024)

Rainbow Variations on a Theme by Mantel: Extremal Problems for Gallai Colouring Templates. - Victor Falgas-Ravry; Klas Markström; Eero Räty (Comb., 2024)

Coherent domains and improved lower bounds for the maximum size of Condorcet domains. - Alexander Karpov; Klas Markström; Søren Riis; Bei Zhou (Discret. Appl. Math., 2025)

Condorcet domains on at most seven alternatives. - Dolica Akello-Egwel; Charles R. Leedham-Green; Alastair Litterick; Klas Markström; Søren Riis (Math. Soc. Sci., 2025)

Near Triple Arrays. - Alexey Gordeev; Klas Markström; Lars-Daniel Öhman (CoRR, 2025)