default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKlas Markström
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j52]Victor Falgas-Ravry, Klas Markström, Eero Räty:
Rainbow Variations on a Theme by Mantel: Extremal Problems for Gallai Colouring Templates. Comb. 44(5): 977-1010 (2024)- [j51]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) - [j50]Charles R. Leedham-Green, Klas Markström, Søren Riis
:
The largest Condorcet domain on 8 alternatives. Soc. Choice Welf. 62(1): 109-116 (2024) - [j49]Bei Zhou, Klas Markström, Søren Riis:
CDL: A fast and flexible library for the study of permutation sets with structural restrictions. SoftwareX 28: 101951 (2024) - [i23]Alexander Karpov, Klas Markström, Søren Riis, Bei Zhou:
Local Diversity of Condorcet Domains. CoRR abs/2401.11912 (2024) - [i22]Klas Markström, Søren Riis, Bei Zhou:
Arrow's single peaked domains, richness, and domains for plurality and the Borda count. CoRR abs/2401.12547 (2024) - [i21]Gerold Jäger, Klas Markström, Lars-Daniel Öhman, Denys Shcherbak:
Enumeration of Row-Column Designs. CoRR abs/2406.16444 (2024) - 2023
- [j48]Joel Larsson Danielsson, Klas Markström:
Polarised random -SAT. Comb. Probab. Comput. 32(6): 885-899 (2023) - [j47]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) - [i20]Victor Falgas-Ravry, Klas Markström, Eero Räty:
Minimum degree conditions for rainbow triangles. CoRR abs/2305.12772 (2023) - [i19]Dolica Akello-Egwell, Charles R. Leedham-Green, Alastair Litterick, Klas Markström, Søren Riis:
Condorcet Domains of Degree at most Seven. CoRR abs/2306.15993 (2023) - [i18]Alexander Karpov, Klas Markström, Søren Riis, Bei Zhou:
Set-alternating schemes: A new class of large Condorcet domains. CoRR abs/2308.02817 (2023) - [i17]Bei Zhou, Klas Markström, Søren Riis:
CDL: A fast and flexible library for the study of permutation sets with structural restrictions. CoRR abs/2309.06306 (2023) - 2022
- [j46]Carl Johan Casselgren, Per Johansson, Klas Markström:
Avoiding and Extending Partial Edge Colorings of Hypercubes. Graphs Comb. 38(3): 79 (2022) - [j45]Per Håkan Lundow, Klas Markström:
Efficient computation of permanents, with applications to Boson sampling and random matrices. J. Comput. Phys. 455: 110990 (2022) - [i16]Victor Falgas-Ravry, Klas Markström, Eero Räty:
Rainbow variations on a theme by Mantel: extremal problems for Gallai colouring templates. CoRR abs/2212.07180 (2022) - 2021
- [j44]Joel Larsson, Klas Markström:
Biased random k-SAT. Random Struct. Algorithms 59(2): 238-266 (2021) - 2020
- [j43]Carl Johan Casselgren, Klas Markström, Lan Anh Pham:
Restricted extension of sparse partial edge colorings of hypercubes. Discret. Math. 343(11): 112033 (2020) - [j42]Carl Johan Casselgren, Klas Markström, Lan Anh Pham:
Edge precoloring extension of hypercubes. J. Graph Theory 95(3): 410-444 (2020) - [j41]Victor Falgas-Ravry, Klas Markström, Andrew Treglown, Yi Zhao:
Existence thresholds and Ramsey properties of random posets. Random Struct. Algorithms 57(4): 1097-1133 (2020)
2010 – 2019
- 2019
- [j40]Carl Johan Casselgren, Klas Markström, Lan Anh Pham:
Latin Cubes with Forbidden Entries. Electron. J. Comb. 26(1): 1 (2019) - [j39]Lina Jansson Andrén, Carl Johan Casselgren, Klas Markström:
Restricted completion of sparse partial Latin squares. Comb. Probab. Comput. 28(5): 675-695 (2019) - [i15]Victor Falgas-Ravry, Klas Markström, Yi Zhao:
Triangle-degrees in graphs and tetrahedron coverings in 3-graphs. CoRR abs/1901.09560 (2019) - [i14]Klas Markström, Carsten Thomassen:
Partite Turán-densities for complete r-uniform hypergraphs on r+1 vertices. CoRR abs/1903.04270 (2019) - [i13]Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman:
Small Youden Rectangles and Their Connections to Other Row-Column Designs. CoRR abs/1910.02791 (2019) - [i12]Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman:
Enumeration of Sets of Mutually Orthogonal Latin Rectangles. CoRR abs/1910.02950 (2019) - 2018
- [j38]Victor Falgas-Ravry, Klas Markström, Jacques Verstraëte:
Full subgraphs. J. Graph Theory 88(3): 411-427 (2018) - [i11]Gerold Jäger, Klas Markström, Lars-Daniel Öhman, Denys Shcherbak:
Triples of Orthogonal Latin and Youden Rectangles For Small Orders. CoRR abs/1810.12639 (2018) - 2016
- [j37]Victor Falgas-Ravry, Klas Markström:
Random Subcube Intersection Graphs I: Cliques and Covering. Electron. J. Comb. 23(3): 3 (2016) - [i10]Victor Falgas-Ravry, Joel Larsson, Klas Markström:
Speed and concentration of the covering time for structured coupon collectors. CoRR abs/1601.04455 (2016) - [i9]Lina Jansson Andrén, Carl Johan Casselgren, Klas Markström:
Restricted completion of sparse partial Latin squares. CoRR abs/1608.07383 (2016) - 2015
- [j36]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: 132-144 (2015) - [j35]Allan Lo, Klas Markström:
F-Factors in Hypergraphs Via Absorption. Graphs Comb. 31(3): 679-712 (2015) - [j34]Klas Markström:
The Straight Line Complexity of Small Factorials and Primorials. Integers 15: A6 (2015) - [i8]Victor Falgas-Ravry, Klas Markström, Jacques Verstraëte:
Full subgraphs. CoRR abs/1505.03072 (2015) - [i7]Klas Markström:
Problem collection from the IML programme: Graphs, Hypergraphs, and Computing. CoRR abs/1511.00270 (2015) - 2014
- [j33]Demetres Christofides, Klas Markström:
The range of thresholds for diameter 2 in random Cayley graphs. Eur. J. Comb. 35: 141-154 (2014) - [j32]Allan Lo, Klas Markström:
Perfect matchings in 3-partite 3-uniform hypergraphs. J. Comb. Theory A 127: 22-57 (2014) - [j31]Klas Markström:
Two Questions of Erdős on Hypergraphs above the Turán Threshold. J. Graph Theory 76(2): 101-105 (2014) - [j30]Demetres Christofides, Klas Markström:
The thresholds for diameter 2 in random Cayley graphs. Random Struct. Algorithms 45(2): 218-235 (2014) - [j29]Allan Lo, Klas Markström:
ℓ-Degree Turán Density. SIAM J. Discret. Math. 28(3): 1214-1225 (2014) - [i6]Klas Markström:
The general graph homomorphism polynomial: Its relationship with other graph polynomials and partition functions. CoRR abs/1401.6335 (2014) - 2013
- [j28]J. Robert Johnson, Klas Markström:
Turán and Ramsey Properties of Subcube Intersection Graphs. Comb. Probab. Comput. 22(1): 55-70 (2013) - [j27]Allan Lo, Klas Markström:
A Multipartite Version of the Hajnal-Szemerédi Theorem for Graphs and Hypergraphs. Comb. Probab. Comput. 22(1): 97-111 (2013) - [j26]Gunnar Brinkmann, Jan Goedgebeur, Jonas Hägglund, Klas Markström:
Generation and properties of snarks. J. Comb. Theory B 103(4): 468-488 (2013) - [j25]Allan Lo, Klas Markström:
Minimum codegree threshold for -factors. J. Comb. Theory A 120(3): 708-721 (2013) - [i5]Jonas Hägglund, Klas Markström:
Shortest cycle covers and cycle double covers with large 2-regular subgraphs. CoRR abs/1306.3088 (2013) - [i4]Klas Markström:
The straight line complexity of small factorials and primorials. CoRR abs/1306.3091 (2013) - [i3]Klas Markström:
Improved bounds for the shortness coefficient of cyclically 4-edge connected cubic graphs and snarks. CoRR abs/1309.3870 (2013) - 2012
- [j24]Jonas Hägglund, Klas Markström:
On stable cycles and cycle double covers of graphs with large circumference. Discret. Math. 312(17): 2540-2544 (2012) - [j23]Klas Markström:
Even cycle decompositions of 4-regular graphs and line graphs. Discret. Math. 312(17): 2676-2681 (2012) - [j22]Demetres Christofides, Klas Markström:
Random Latin square graphs. Random Struct. Algorithms 41(1): 47-65 (2012) - [i2]Gunnar Brinkmann, Jan Goedgebeur, Jonas Hägglund, Klas Markström:
Generation and Properties of Snarks. CoRR abs/1206.6690 (2012) - 2011
- [j21]Demetres Christofides, Klas Markström:
The Guessing Number of Undirected Graphs. Electron. J. Comb. 18(1) (2011) - [j20]Klas Markström, Andrzej Rucinski:
Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees. Eur. J. Comb. 32(5): 677-687 (2011) - [j19]Klas Markström, Andrew Thomason, Peter Wagner:
Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree. Graphs Comb. 27(2): 243-249 (2011) - [i1]Klas Markström:
Two questions of Erdős on hypergraphs above the Turán threshold. CoRR abs/1111.5743 (2011) - 2010
- [j18]Anders Johansson, Robert Johansson, Klas Markström:
Factors of r-partite graphs and bounds for the Strong Chromatic Number. Ars Comb. 95 (2010) - [j17]Klas Markström, Lars-Daniel Öhman:
Unavoidable arrays. Contributions Discret. Math. 5(1) (2010) - [j16]Klas Markström, John C. Wierman:
Aperiodic Non-Isomorphic Lattices with Equivalent Percolation and Random-Cluster Models. Electron. J. Comb. 17(1) (2010) - [j15]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): 3692-3699 (2010)
2000 – 2009
- 2009
- [j14]Klas Markström:
A note on uniquely pancyclic graphs. Australas. J Comb. 44: 105-110 (2009) - [j13]Daniel Andrén, Klas Markström:
The bivariate Ising polynomial of a graph. Discret. Appl. Math. 157(11): 2515-2524 (2009) - [j12]Klas Markström:
Extremal hypergraphs and bounds for the Turán density of the 4-uniform K5. Discret. Math. 309(16): 5231-5234 (2009) - 2008
- [j11]Shmuel Friedland, Elliot Krop, Klas Markström:
On the Number of Matchings in Regular Graphs. Electron. J. Comb. 15(1) (2008) - [j10]Daniel Andrén, Lars Hellström, Klas Markström:
Fast multiplication of matrices over a finitely generated semiring. Inf. Process. Lett. 107(6): 230-234 (2008) - [j9]Per Håkan Lundow, Klas Markström:
Exact and Approximate Compression of Transfer Matrices for Graph Homomorphisms. LMS J. Comput. Math. 11: 1-14 (2008) - [j8]Demetres Christofides, Klas Markström:
Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales. Random Struct. Algorithms 32(1): 88-100 (2008) - 2007
- [j7]Daniel Andrén, Lars Hellström, Klas Markström:
On the complexity of matrix reduction over finite fields. Adv. Appl. Math. 39(4): 428-452 (2007) - 2006
- [j6]Imre Leader, Klas Markström:
Uncountable families of vertex-transitive graphs of finite degree. Discret. Math. 306(7): 678-679 (2006) - [j5]Roland Häggkvist, Klas Markström:
Cycle double covers and spanning minors II. Discret. Math. 306(8-9): 762-778 (2006) - [j4]Per Håkan Lundow, Klas Markström:
Broken-Cycle-Free Subgraphs and the Log-Concavity Conjecture for Chromatic Polynomials. Exp. Math. 15(3): 343-353 (2006) - [j3]Roland Häggkvist, Klas Markström:
Cycle double covers and spanning minors I. J. Comb. Theory B 96(2): 183-206 (2006) - [j2]Klas Markström:
Locality and Hard SAT-Instances. J. Satisf. Boolean Model. Comput. 2(1-4): 221-227 (2006) - 2004
- [j1]Klas Markström:
Complete Minors in Cubic Graphs with few short Cycles and Random Cubic Graphs. Ars Comb. 70 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
