20 citations · 75 across the 14 of their papers we have counts for
4 papers · 1 filter
Coxeter tournaments
Brett Kolesnik, Mario Sanchez
We describe the Coxeter permutahedra, recently studied by Ardila, Castillo, Eur and Postnikov, in terms of random Coxeter tournaments, which involve cooperative and solitaire games…
The asymptotic number of score sequences
Brett Kolesnik
A tournament on a graph is an orientation of its edges. The score sequence lists the in-degrees in non-decreasing order. Works by Winston and Kleitman (1983) and Kim and Pittel (20…
The geometry of random tournaments
Mario Sanchez, Brett Kolesnik
A tournament is an orientation of a graph. Each edge represents a match, directed towards the winner. The score sequence lists the number of wins by each team. Landau (1953) charac…
Lower bounds for the isoperimetric numbers of random regular graphs
Brett Kolesnik, Nick Wormald
The vertex isoperimetric number of a graph is the minimum of the ratio where ranges over all nonempty subsets of with and $\p…