Klas Markström

1.2k total citations
69 papers, 585 citations indexed

About

Klas Markström is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Klas Markström has authored 69 papers receiving a total of 585 indexed citations (citations by other indexed papers that have themselves been cited), including 42 papers in Computational Theory and Mathematics, 34 papers in Discrete Mathematics and Combinatorics and 22 papers in Geometry and Topology. Recurrent topics in Klas Markström's work include Advanced Graph Theory Research (31 papers), Limits and Structures in Graph Theory (31 papers) and Graph theory and applications (16 papers). Klas Markström is often cited by papers focused on Advanced Graph Theory Research (31 papers), Limits and Structures in Graph Theory (31 papers) and Graph theory and applications (16 papers). Klas Markström collaborates with scholars based in Sweden, United Kingdom and United States. Klas Markström's co-authors include P. H. Lundow, Allan Lo, Andrzej Ruciński, Anders Rosengren, Daniel Andrén, Roland Häggkvist, Shmuel Friedland, Anders Behndig, Petras J. Kundrotas and Alioscia Hamma and has published in prestigious journals such as Nuclear Physics B, Journal of Computational Physics and IEEE Transactions on Information Theory.

In The Last Decade

Klas Markström

64 papers receiving 551 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Klas Markström Sweden	14	227	208	163	118	107	69	585
Mariya Shcherbina Ukraine	13	53 0.2×	152 0.7×	140 0.9×	77 0.7×	359 3.4×	31	661
Hugh Thomas Canada	16	96 0.4×	347 1.7×	54 0.3×	437 3.7×	157 1.5×	56	672
Lauren Williams United States	18	164 0.7×	572 2.8×	36 0.2×	499 4.2×	279 2.6×	44	997
Bálint Virág Canada	15	126 0.6×	292 1.4×	104 0.6×	289 2.4×	691 6.5×	43	1.1k
Estelle Basor United States	16	73 0.3×	111 0.5×	98 0.6×	61 0.5×	266 2.5×	45	630
Jens Marklof United Kingdom	16	36 0.2×	42 0.2×	54 0.3×	104 0.9×	329 3.1×	58	605
Boris A. Khoruzhenko United Kingdom	15	44 0.2×	157 0.8×	83 0.5×	99 0.8×	377 3.5×	25	786
Michel Waldschmidt France	17	259 1.1×	99 0.5×	31 0.2×	489 4.1×	364 3.4×	77	968
Анатолий Моисеевич Вершик Russia	17	203 0.9×	131 0.6×	27 0.2×	432 3.7×	735 6.9×	94	1.1k
Sóstenes Lins Brazil	11	178 0.8×	153 0.7×	26 0.2×	347 2.9×	226 2.1×	27	640

Countries citing papers authored by Klas Markström

Since Specialization

Citations

This map shows the geographic impact of Klas Markström's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Klas Markström with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Klas Markström more than expected).

Fields of papers citing papers by Klas Markström

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Klas Markström. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Klas Markström. The network helps show where Klas Markström may publish in the future.

Co-authorship network of co-authors of Klas Markström

This figure shows the co-authorship network connecting the top 25 collaborators of Klas Markström. A scholar is included among the top collaborators of Klas Markström based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Klas Markström. Klas Markström is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Leedham-Green, C. R., et al.. (2024). Condorcet domains on at most seven alternatives. Mathematical Social Sciences. 133. 23–33. 1 indexed citations

Leedham-Green, C. R., Klas Markström, & Søren Riis. (2023). The largest Condorcet domain on 8 alternatives. Social Choice and Welfare. 62(1). 109–116. 4 indexed citations

Johansson, Per, et al.. (2022). Avoiding and Extending Partial Edge Colorings of Hypercubes. Graphs and Combinatorics. 38(3). 2 indexed citations

Markström, Klas, et al.. (2020). Edge precoloring extension of hypercubes. Journal of Graph Theory. 95(3). 410–444. 4 indexed citations

Markström, Klas, et al.. (2020). Existence thresholds and Ramsey properties of random posets. Random Structures and Algorithms. 57(4). 1097–1133. 6 indexed citations

Akbari, Saieed, et al.. (2014). 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. 45. 132–144. 7 indexed citations

Lo, Allan & Klas Markström. (2014). Perfect matchings in 3-partite 3-uniform hypergraphs. Journal of Combinatorial Theory Series A. 127. 22–57. 8 indexed citations

Markström, Klas. (2013). Two Questions of Erdős on Hypergraphs above the Turán Threshold. Journal of Graph Theory. 76(2). 101–105.

Markström, Klas. (2012). Even cycle decompositions of 4-regular graphs and line graphs. Discrete Mathematics. 312(17). 2676–2681. 9 indexed citations

10.

Johansson, Anders, et al.. (2010). Factors of r-partite graphs and bounds for the strong chromatic number. Ars Combinatoria. 95. 277–287. 2 indexed citations

11.

Markström, Klas. (2009). A note on uniquely pancyclic graphs. The Australasian Journal of Combinatorics. 44. 105–110. 3 indexed citations

12.

Markström, Klas. (2009). Extremal hypergraphs and bounds for the Turán density of the 4-uniform K5. Discrete Mathematics. 309(16). 5231–5234. 5 indexed citations

13.

Andrén, Daniel & Klas Markström. (2009). The bivariate Ising polynomial of a graph. Discrete Applied Mathematics. 157(11). 2515–2524. 9 indexed citations

14.

Markström, Klas. (2007). Negative Association Does not Imply Log-Concavity of the Rank Sequence. Journal of Applied Probability. 44(4). 1119–1121. 2 indexed citations

15.

Friedland, Shmuel, P. H. Lundow, & Klas Markström. (2006). Theoretical and computational aspects of 1-vertex transfer matrices. arXiv (Cornell University). 1 indexed citations

16.

Häggkvist, Roland & Klas Markström. (2006). Cycle double covers and spanning minors II. Discrete Mathematics. 306(8-9). 762–778. 3 indexed citations

17.

Markström, Klas. (2006). Locality and Hard SAT-Instances. 2(1-4). 221–227. 8 indexed citations

18.

Häggkvist, Roland & Klas Markström. (2005). Cycle double covers and spanning minors I. Journal of Combinatorial Theory Series B. 96(2). 183–206. 9 indexed citations

19.

Markström, Klas. (2004). Complete minors in cubic graphs with few short cycles and random cubic graphs. Ars Combinatoria. 70. 289–295. 4 indexed citations

20.

Häggkvist, Roland, Anders Rosengren, Daniel Andrén, et al.. (2004). Computation of the Ising partition function for two-dimensional square grids. Physical Review E. 69(4). 46104–46104. 12 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact