2 citations · 2 across the 4 of their papers we have counts for
5 papers
Bijective enumeration of rook walks
Alexander M. Haupt
In this paper we answer a question posed by R. Stanley in his collection of Bijection Proof Problems (Problem 240). We present a bijective proof for the enumeration of walks of len…
Combinatorial Proof of Selberg's Integral Formula
Alexander Haupt
In this paper we present a combinatorial proof of Selberg's integral formula. We start by giving a bijective proof of a Theorem about the number of topological orders of a certain…
Fast Strategies in Waiter-Client Games on
Dennis Clemens, Pranshu Gupta, Fabian Hamann +3
Waiter-Client games are played on some hypergraph , where denotes the family of winning sets. For some bias , during each round of such a game Wai…
Enumeration of -omino towers and row-convex -omino towers
Alexander M. Haupt
We first enumerate a generalization of domino towers that was proposed by Tricia M. Brown (J. Integer Seq. 20 (2017)), which we call S-omino towers. We establish equations that the…
A natural generalisation in graph Ramsey theory
Alexander Haupt, Damian Reding
In this note we study graphs with the property that every colouring of with colours admits a copy of some graph using at most colours. For $1\le r\le e…