1 citations · 1 across the 5 of their papers we have counts for
5 papers
On modular balanced partition designs
S. Karthik, Peter J. Cameron, Krishnan Paramasivam
Let be a finite set of integers with cardinality . A \emph{modular balanced partition design} is a triplet satisfying the following condi…
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…
Regular bipartite multigraphs have many (but not too many) symmetries
Peter J. Cameron, Coen del Valle, Colva M. Roney-Dougal
Let and be integers, both at least 2. A -bipartite graph is an -regular bipartite multigraph with coloured bipartite sets of size . Define and $μ(k,l)…
Minimal cover groups
Peter J. Cameron, David Craven, Hamid Reza Dorbidi +2
Let be a set of finite groups. A finite group is called an \emph{-cover} if every group in is isomorphic to a subgroup of . An $\mat…
Moving to Extremal Graph Parameters
P. J. Cameron, C. A. Glass, R. U. Schumacher
Which graphs, in the class of all graphs with given numbers n and m of edges and vertices respectively, minimizes or maximizes the value of some graph parameter? In this paper we d…