6 citations · 12 across the 6 of their papers we have counts for
4 papers · 1 filter
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…
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…
A proof of a conjecture of Buck, Chan and Robbins on the random assignment problem
Svante Linusson, Johan W"astlund
We prove the main conjecture of the paper ``On the expected value of the minimum assignment'' by Marshall W. Buck, Clara S. Chan, and David P. Robbins (Random Structures & Algorith…