6 citations · 18 across the 7 of their papers we have counts for
7 papers
Slither code and the independence number of a random tree
Johan Wästlund
We give a simple characterisation of the distribution of the independence number, and equivalently the matching number, of a random tree on labelled vertices chosen uniformly a…
Faulty picture-hanging improved
Johan Wästlund
A picture-hanging puzzle is the task of hanging a framed picture with a wire around a set of nails in such a way that it can remain hanging on certain specified sets of nails, but…
Padlock Solitaire: A martingale trick for combinatorial enumeration
Johan Wästlund
We introduce a one-person game that we call Padlock Solitaire which resembles the well-known clock solitaire card game. Analyzing variants of this game we obtain simple proofs of s…
Endgames in bidding chess
Urban Larsson, Johan Wästlund
Bidding chess is a chess variant where instead of alternating play, players bid for the opportunity to move. Generalizing a known result on so-called Richman games, we show that fo…
Games on Random Boards
Riddhipratim Basu, Alexander E. Holroyd, James B. Martin +1
We consider the following two-player game on a graph. A token is located at a vertex, and the players take turns to move it along an edge to a vertex that has not been visited befo…
Replica Symmetry and Combinatorial Optimization
Johan Wästlund
We establish the soundness of the replica symmetric ansatz introduced by M. Mezard and G. Parisi for minimum matching and the traveling salesman problem in the pseudo-dimension d m…