21 citations · 37 across the 10 of their papers we have counts for
10 papers
Diameter Thresholds of Random Cayley Graphs
Demetres Christofides, Klas Markström, Christina Savvidou
Given a group , the model denotes the probability space of all Cayley graphs of where each element of is included in the generating set independently…
Rainbow subgraphs of star-coloured graphs
Allan Lo, Klas Markström, Dhruv Mubayi +3
An edge-colouring of a graph can fail to be rainbow for two reasons: either it contains a monochromatic cherry (a pair of incident edges), or a monochromatic matching of size t…
More, better or different? Trade-offs between group size and competence development in jury theorems
Gustaf Arrhenius, Klas Markström
In many circumstances there is a trade off between the number of voters and the time they can be given before having to make a decision since both aspects are costly. An example is…
Polarised random k-SAT
Joel Larsson Danielsson, Klas Markström
In this paper we study a variation of the random -SAT problem, called polarized random -SAT. In this model there is a polarization parameter , and in half of the clauses e…
Random Uniform and Pure Random Simplicial Complexes
Klas Markström, Trevor Pinto
In this paper we introduce a method which allows us to study properties of the random uniform simplicial complex. That is, we assign equal probability to all simplicial complexes w…
Partite Turán-densities for complete uniform hypergraphs on vertices
Klas Markström, Carsten Thomassen
In this paper we investigate density conditions for finding a complete -uniform hypergraph on vertices in an -partite -uniform hypergraph . Fi…