Peter J. Cameron

collaborators

3 papers

math.CO2026

On modular balanced partition designs

S. Karthik, Peter J. Cameron, Krishnan Paramasivam

Let $X$ be a finite set of integers with cardinality $I^½ = I^º I^»$ . A \emph{modular balanced partition design} is a triplet $(X, A, B)$ satisfying the following co…

math.CO2026

Around homogeneity

Peter J. Cameron

Forty-five years ago, a young researcher in finite permutation group theory encountered a paper by Robert Woodrow. The homogeneous triangle-free graph Woodrow described there seeme…

math.CO2025

Regular bipartite multigraphs have many (but not too many) symmetries

Peter J. Cameron, Coen del Valle, Colva M. Roney-Dougal

Let $k$ and $l$ be integers, both at least 2. A $(k, l)$ -bipartite graph is an $l$ -regular bipartite multigraph with coloured bipartite sets of size $k$ . Define $I ¨ (k, l)$ and $Î¼(k,…