P. Danziger

collaborators

4 papers

math.CO2026

Colourings of Uniform Group Divisible Designs and Maximum Packings

Andrea C Burgess, Peter Danziger, Diane Donovan +4

A weak $c$ -colouring of a design is an assignment of colours to its points from a set of $c$ available colours, such that there are no monochromatic blocks. A colouring of a design…

math.CO2026

A complete solution to the directed Oberwolfach problem of order $2 (mod 4)$ with cycles of even lengths

A. C. Burgess, P. H. Danziger, A. Lacaze-Masmonteil

The Oberwolfach problem asks for a $2$ -factorization of the complete graph in which each $2$ -factor is isomorphic to a specific factor $F$ . Recently, this problem has been extended…

math.CO2025

Packing Designs with large block size

Andrea C. Burgess, Peter Danziger, Daniel Horsley +1

Given positive integers $v$ , $k$ , $t$ and $I^»$ with $v \geq k \geq t$ , a packing design PD $_{I^} » (v, k, t)$ is a pair $(V, B)$ , where $V$ is a $v$ -set and $B$ is a co…

math.CO2025

Weak colourings of Kirkman triple systems

Andrea C. Burgess, Nicholas J. Cavenagh, Peter Danziger +1

A $I^´$ -colouring of the point set of a block design is said to be {\em weak} if no block is monochromatic. The {\em chromatic number} $I ¨ (S)$ of a block design $S$ is the smallest…

Colourings of Uniform Group Divisible Designs and Maximum Packings

A complete solution to the directed Oberwolfach problem of order 2(mod4) with cycles of even lengths

Packing Designs with large block size

Weak colourings of Kirkman triple systems

A complete solution to the directed Oberwolfach problem of order $2 (mod 4)$ with cycles of even lengths