Klas Markström

82 papers Journal 82

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