Nicholas J. Cavenagh

•  Email:  njc@maths.uq.edu.au
• Phone: (07) 3346 1440
• Fax: (07) 336 51477
• Room: 511 (Priestley, Mathematics Building)
• Nick's personal home page

Postal Address

Department of Mathematics

The University of Queensland

Queensland 4072

AUSTRALIA

Subjects

• MATH1061

Areas of Interest

• My PhD is on latin trades, critical sets, and various extensions of the idea of a latin square.
• Other mathematical interests: decompositions of graphs into cycles, designs on complete multipartite graphs, permutation groups.

Publications

The following files are in pdf format, please email me should you require them in another format. I can snail mail you copies of the final two papers.

• N. Cavenagh, Latin trade algorithms and the size of the smallest critical set in a latin square, in: Proc. Thirteenth Australasian Workshop on Combinatorial Algorithms, (University of Queensland, Queensland, 2002), 61--74.
• N. Cavenagh, The size of the smallest latin trade in the back circulant latin square, Bulletin of the ICA (to appear).
• N. Cavenagh and A. Khodkar, Balanced critical sets in Latin squares, Utilitas Math., (to appear).
• N. Cavenagh, A new bound on the size of the largest 2-critical set in a latin square, Australas. J. Combinatorics (to appear).
• N. Cavenagh, Decompositions of complete tripartite graphs into triangles with an edge attached, Utilitas Math. (to appear).
• N. Cavenagh, Further decompositions of complete tripartite graphs into $5$-cycles Discrete Math. (to appear).
• N. Cavenagh and E.J. Billington, On decomposing complete tripartite graphs into $5$-cycles, Australas. J. Combinatorics 22 (2000), 41--62.
• N. Cavenagh and E.J. Billington, Decompositions of complete mutlipartite graphs into cycles of even length, Graphs Combin. 16 (2000), 49--65.
• N. Cavenagh, Decompositions of complete tripartite graphs into k-cycles, Australas. J. Combinatorics 18 (1998), 193--200.

Links

• Algebra/Combinatorics Seminars

Last modified 25th of July 2001