Other combinatorics

TopicsSome of my publications
Intricacy
  • W. E. Opencomb (pseudonym for R. A. Bailey, P. J. Cameron, A. G. Chetwynd, D. E. Daykin, A. J. W. Hilton, F. C. Holroyd, J. H. Mason, R. Nelson, C. A. Rowley and D. R. Woodall): On the intricacy of combinatorial construction problems. Discrete Mathematics 50 (1984), 71–97. [Maths Reviews 0747713 (86a: 05002)]
  • Using graphs to describe statistical models
  • R. A. Bailey and C. A. Rowley: Contribution to the discussion of `On substantive research hypotheses, conditional independence graphs and graphical chain models' by N. Wermuth and S. L. Lauritzen. Journal of the Royal Statistical Society, Series B 52 (1990), p. 57.
  • Equitable partitions
  • R. A. Bailey, Peter J. Cameron, Alexander L. Gavrilyuk and Sergey V. Goryainov: Equitable partitions of Latin-square graphs. Journal of Combinatorial Designs, 27, (2019), 142–160. doi: 10.1002/jcd.21634
  • Diagonal structures. These are families of mutually compatible partitions, closed under suprema, such that any specified number are the minimal partitions in a Cartesian lattice.
  • R. A. Bailey and Peter J. Cameron: The diagonal graph. Journal of the Ramanujan Mathematical Society, 36 (2021), 353–361.
  • Page maintained by R. A. Bailey