The following pages link to Klas Markström (Q311573):
Displaying 50 items.
- Random subcube intersection graphs. I: Cliques and covering (Q311574) (← links)
- The scaling window of the 5D Ising model with free boundary conditions (Q318743) (← links)
- Perfect matchings in 3-partite 3-uniform hypergraphs (Q406558) (← links)
- On stable cycles and cycle double covers of graphs with large circumference (Q442360) (← links)
- Even cycle decompositions of 4-regular graphs and line graphs (Q442390) (← links)
- Generation and properties of snarks (Q463288) (← links)
- (Q482132) (redirect page) (← links)
- Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges (Q482134) (← links)
- Non-vanishing boundary effects and quasi-first-order phase transitions in high dimensional Ising models (Q632118) (← links)
- Closure properties and negatively associated measures violating the Van den Berg-Kesten inequality (Q638223) (← links)
- The guessing number of undirected graphs (Q640453) (← links)
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees (Q641543) (← links)
- Properly edge-coloured subgraphs in colourings of bounded degree (Q659683) (← links)
- Latin cubes with forbidden entries (Q668044) (← links)
- Finite size scaling of the 5D Ising model with free boundary conditions (Q895359) (← links)
- The discontinuity of the specific heat for the 5D Ising model (Q906678) (← links)
- Fast multiplication of matrices over a finitely generated semiring (Q963453) (← links)
- The bivariate Ising polynomial of a graph (Q967288) (← links)
- Aperiodic non-isomorphic lattices with equivalent percolation and random-cluster models (Q976690) (← links)
- (Q1010841) (redirect page) (← links)
- On the number of matchings in regular graphs (Q1010842) (← links)
- On the validations of the asymptotic matching conjectures (Q1012650) (← links)
- Extremal hypergraphs and bounds for the Turán density of the 4-uniform \(K_{5}\) (Q1044999) (← links)
- Stability versus hyperbolicity in dynamical and iterated function systems (Q1396790) (← links)
- A Monte Carlo sampling scheme for the Ising model (Q1777759) (← links)
- Minimum codegree threshold for \((K^3_4-e)\)-factors (Q1940381) (← links)
- Partite Turán-densities for complete \(r\)-uniform hypergraphs on \(r+1\) vertices (Q2041694) (← links)
- Avoiding and extending partial edge colorings of hypercubes (Q2122768) (← links)
- Efficient computation of permanents, with applications to boson sampling and random matrices (Q2133747) (← links)
- Restricted extension of sparse partial edge colorings of hypercubes (Q2198375) (← links)
- \(F\)-factors in hypergraphs via absorption (Q2345534) (← links)
- Shortest cycle covers and cycle double covers with large 2-regular subgraphs (Q2449975) (← links)
- On the complexity of matrix reduction over finite fields (Q2467342) (← links)
- Uncountable families of vertex-transitive graphs of finite degree (Q2488943) (← links)
- Cycle double covers and spanning minors. I (Q2490249) (← links)
- Cycle double covers and spanning minors. II (Q2495513) (← links)
- The range of thresholds for diameter 2 in random Cayley graphs (Q2509744) (← links)
- On 1-sum flows in undirected graphs (Q2834760) (← links)
- Random Latin square graphs (Q2909242) (← links)
- The thresholds for diameter 2 in random Cayley graphs (Q2925523) (← links)
- ${\ell}$-Degree Turán Density (Q2935266) (← links)
- Exact and Approximate Compression of Transfer Matrices for Graph Homomorphisms (Q3091955) (← links)
- (Q3114965) (← links)
- Existence thresholds and Ramsey properties of random posets (Q3386529) (← links)
- (Q3429165) (← links)
- Broken-Cycle-Free Subgraphs and the Log-Concavity Conjecture for Chromatic Polynomials (Q3431992) (← links)
- (Q3558654) (← links)
- On the density of 2-colorable 3-graphs in which any four points span at most two edges (Q3576967) (← links)
- (Q3635514) (← links)
- Full subgraphs (Q4581273) (← links)
