Kirkman's hypothesis revisited
A. Panholzer, H. Prodinger
math.COarXiv:math/0010229
Abstract
Watson proved Kirkman's hypothesis (partially solved by Cayley). Using Lagrange Inversion, we drastically shorten Watson's computations and generalize his results at the same time.
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell