Co-authors

Peter Cameron's joint papers

Aalipour, G.

  1. Ghodratallah Aalipour, Saieed Akbari, Peter J. Cameron, Reza Nikandish and Farzad Shaveisi, On the structure of the power graph and the enhanced power graph of a group, Electronic J. Combinatorics 24(3) (2017), P3.16

Akbari, S.

  1. Ghodratallah Aalipour, Saieed Akbari, Peter J. Cameron, Reza Nikandish and Farzad Shaveisi, On the structure of the power graph and the enhanced power graph of a group, Electronic J. Combinatorics 24(3) (2017), P3.16

Alejandro, P. P. = Kazanidis, P. A.

  1. P. P. Alejandro, R. A. Bailey and P. J. Cameron, Association schemes and permutation groups, Discrete Math. 266 (2003), 47-67.
  2. P. J. Cameron and P. A. Kazanidis, Cores of symmetric graphs, J. Australian Math. Soc. 85 (2008), 145-154; doi: 10.1017/S1446788708000815

Aljohani, M.

  1. M. Aljohani, J. Bamberg and P. J. Cameron, Synchronization and separation in the Johnson schemes, Portugaliae Mathematica, in press

André, J.

  1. J. André, J. Araújo and P. J. Cameron, The classification of partition homogeneous groups with applications to semigroup theory, J. Algebra 452 (2016), 288-310; doi: 10.1016/j.jalgebra.2015.12.025

Applegate, R.

  1. R. Applegate and P. J. Cameron, Orbits on n-tuples, Communications in Algebra 37 (2009), 269-275; doi: 10.1080/00927870802243739

Araújo, J.

  1. J. Araújo, P. J. Cameron, J. D. Mitchell and M. Neunhöffer, The classification of normalizing groups, J. Algebra 373 (2013), 481-490: doi: 10.1016/j.jalgebra.2012.08.033
  2. J. Araújo, W. Bentz and P. J. Cameron, Groups synchronizing a map of non-uniform kerel, Theoretical Computer Science 498 (2013), 1-9; doi: 10.1016/j.tcs.2013.06.016
  3. J. Araújo and P. J. Cameron, Two generalizations of homogeneity in groups with applications to regular semigroups, Trans. Amer. Math. Soc. 368 (2016), 1159-1188; doi: 10.1090/tran/6368; arXiv 1204.2195
  4. J. Araújo and P. J. Cameron, Primitive groups synchronize non-uniform maps of extreme ranks, J. Combinatorial Theory (B) 106 (2014), 98-114; doi: 10.1016/j.jctb.2014.01.006
  5. J. Araújo and P. J. Cameron, Permutation groups and transformation semigroups: results and problems, in Proceedings of Groups St Andrews 2013 (ed. C. M. Campbell, M. R. Quick, E. F. Robertson, C. M. Roney-Dougal), London Math. Soc. Lecture Notes 422, Cambridge University Press, Cambridge, 2015
  6. J. André, J. Araújo and P. J. Cameron, The classification of partition homogeneous groups with applications to semigroup theory, J. Algebra 452 (2016), 288-310; doi: 10.1016/j.jalgebra.2015.12.025
  7. J. Araújo, W. Bentz, P. J. Cameron, G. F. Royle, and A. Schaefer, Primitive groups, graph endomorphisms and synchronization, Proc. London Math. Soc 113 (2016), 829-867; doi: 10.1112/plms/pdw040
  8. J. Araújo, J. P. Araújo, P. J. Cameron, T. Dobson, A. Hulpke and P. Lopes, Imprimitive permutations in primitive groups, J. Algebra 486 (2017), 396-416; doi: 10.1016/j.jalgebra.2017.03.043
  9. J. Araújo, W. Bentz and P. J. Cameron, Orbits of primitive k-homogenous groups on (nk)-partitions with applications to semigroups, Trans. Amer. Math. Soc., in press; doi: 10.1090/tran/7274
  10. J. Araújo, P. J. Cameron and B. Steinberg, Between primitive and 2-transitive: synchronization and its friends, Europ. Math. Soc. Surveys, in press

Araújo, J. P.

  1. J. Araújo, J. P. Araújo, P. J. Cameron, T. Dobson, A. Hulpke and P. Lopes, Imprimitive permutations in primitive groups, J. Algebra 486 (2017), 396-416; doi: 10.1016/j.jalgebra.2017.03.043

Babai, L.

  1. L. Babai, P. J. Cameron, M. Deza and N. M. Singhi, On sharply edge-transitive permutation groups, J. Algebra 73 (1981), 573-585.
  2. L. Babai, P. J. Cameron and P. P. Pálfy, On the orders of primitive groups with bounded non-abelian composition factors, J. Algebra 79 (1982), 161-168.
  3. L. Babai and P. J. Cameron, Automorphisms and enumeration of switching classes of tournaments, Electronic J. Combinatorics 7(1) (2000), article #R38.
  4. L. Babai and P. J. Cameron, Most primitive groups are full automorphism groups of edge-transitive hypergraphs, J. Algebra 10.1016/j.jalgebra.2014.09.002

Bailey, R. A.

  1. 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 Math. 50 (1984), 71-97.
  2. P. P. Alejandro, R. A. Bailey and P. J. Cameron, Association schemes and permutation groups, Discrete Math. 266 (2003), 47-67.
  3. R. A. Bailey and P. J. Cameron, Crested products of association schemes, J. London Math. Soc. 72 (2005), 1-24; doi: 10.1112/S0024610705006666
  4. R. A. Bailey, P. J. Cameron, P. Dobcsányi, J. P. Morgan, and L. H. Soicher, Designs on the Web, Discrete Math. 306 (2006), 3014-3027; doi: 10.1016/j.disc.2004.10.027
  5. R. A. Bailey and P. J. Cameron, A family of balanced incomplete-block designs with repeated blocks on which general linear groups act, J. Combinatorial Designs 15 (2007), 143-150; doi: 10.1002/jcd.20120
  6. R. A. Bailey and P. J. Cameron, What is a design? How should we classify them? Designs, Codes, Crypt., in press; doi: 10.1007/s10623-007-9092-3
  7. R. A. Bailey, P. J. Cameron and R. Connelly, Sudoku, gerechte designs, resolutions, affine space, spreads, reguli, and Hamming codes, American Math. Monthly 115 (2008), 383-404.
  8. R. A. Bailey and P. J. Cameron, Combinatorics of Optimal Designs, in Surveys in Combinatorics 2009 (ed. S. Huczynska, J. D. Mitchell and C. M. Roney-Dougal), London Math. Soc. Lecture Notes 365, Cambridge University Press 2009, pp. 19-73.
  9. R. A. Bailey and P. J. Cameron, Using graphs to find the best block designs, in Structural Graph Theory (ed. L. W. Beineke and R. J. Wilson), Encyclopedia of Mathematics and its Applications 147, Cambridge University Press, 2013, pp. 282-317.
  10. R. A. Bailey, P. J. Cameron, K. Filipiak, J. Kunert and A. Markiewicz, On optimality and construction of circular repeated-measurements designs, Statistica Sinica 27 (2017), 1-22; doi: 10.5705/ss.202015.0045

Bailey, R. F.

  1. R. F. Bailey and P. J. Cameron, On the single-orbit conjecture for uncoverings-by-bases, J. Group Theory 11 (2008), 845-850; doi: 10.1515/JGT.2008.053
  2. R. F. Bailey and P. J. Cameron, Base size, metric dimension, and other invariants of groups and graphs, Bull. London Math. Soc. 43 (2011), 209-242; doi: 10.1112/blms/bdq096

Bamberg, J.

  1. M. Aljohani, J. Bamberg and P. J. Cameron, Synchronization and separation in the Johnson schemes, Portugaliae Mathematica, in press

Bannai, E. E.

  1. E. E. Bannai, P. J. Cameron and J. Kahn, Nonexistence of certain distance-transitive digraphs, J. Combinatorial Theory (B) 31 (1981), 105-110.

Beineke, L. W.

  1. L. W. Beineke, P. J. Cameron and R. J. Wilson, Introduction, in Topics in Algebraic Graph Theory (ed. L. W. Beineke and R. J. Wilson), Cambridge Univ. Press, Cambridge, 2004 (ISBN 0521801974), pp.1-29.

Bell, J. P.

  1. J. P. Bell, E. A. Bender, P. J. Cameron and L. B. Richmond, Asymptotics for the probability of connectedness and the distribution of number of components, Electronic J. Combinatorics 7(1) (2000), article #R33.

Bender, E. A.

  1. E. A. Bender, P. J. Cameron, A. M. Odlyzko and L. B. Richmond, Connectedness, classes and cycle index, Combinatorics, Probability and Computing 8 (1999), 31-43.
  2. J. P. Bell, E. A. Bender, P. J. Cameron and L. B. Richmond, Asymptotics for the probability of connectedness and the distribution of number of components, Electronic J. Combinatorics 7(1) (2000), article #R33.

Bentz, W.

  1. J. Araújo, W. Bentz and P. J. Cameron, Groups synchronizing a map of non-uniform kerel, Theoretical Computer Science 498 (2013), 1-9; doi: 10.1016/j.tcs.2013.06.016
  2. J. Araújo, W. Bentz, P. J. Cameron, G. F. Royle, and A. Schaefer, Primitive groups, graph endomorphisms and synchronization, Proc. London Math. Soc 113 (2016), 829-867; doi: 10.1112/plms/pdw040
  3. J. Araújo, W. Bentz and P. J. Cameron, Orbits of primitive k-homogenous groups on (nk)-partitions with applications to semigroups, Trans. Amer. Math. Soc., in press; doi: 10.1090/tran/7274

Beutelspacher, A.

  1. A. Beutelspacher and P. J. Cameron, Transfinite methods in geometry, Bull. Belgian Math. Soc. 1 (1994), 337-347.

Blokhuis, A.

  1. A. Blokhuis, P. J. Cameron and J. A. Thas, On a generalization of a theorem of B. Segre, Geometriae Dedicata 43 (1992), 299-305.

Bohn, Adam

  1. A. Bohn, P. J. Cameron and P. Müller, Galois groups of multivariate Tutte polynomials, J. Algebraic Combinatorics 36 (2012), 223-230; doi: 10.1007/s10801-011-0332-2

Bonato, A.

  1. A. Bonato, P. J. Cameron and D. Delić, Tournaments and orders with the pigeonhole property, Canadian Math. Bull. 43 (2000), 397-405.
  2. A. Bonato, P. J. Cameron, D. Delić and S. Thomassé, Generalized pigeonhole properties of graphs and oriented graphs, European J. Combinatorics 23 (2002), 257-274.

Britz, T.

  1. P. J. Cameron and T. Britz, Codes, chapter in Handbook of the Tutte Polynomial.

Brouwer, A. E.

  1. A. E. Brouwer, P. J. Cameron, W. H. Haemers and D. A. Preece, Self-dual, not self-polar, Discrete Math. 306 (2006), 3051-3053; doi: 10.1016/j.disc.2004.11.027

Browning, J. M.

  1. J. M. Browning, P. J. Cameron and I. M. Wanless, Bounds on the number of small Latin subsquares, J. Combinatorial Theory (A) 124 (2014), 41-56; doi: 10.1016/j.jcta.2014.01.002

Buchheim, C.

  1. C. Buchheim, P. J. Cameron and T. Wu, On the subgroup distance problem, Discrete Math. 309 (2009), 962-968; doi: 10.1016/j.disc.2008.01.036

Budd, C.

  1. C. Budd, P. Cameron, S. Cooter and D. Spiegelhalter, The making of To Infinity and Beyond!, Mathematics Today 46 (2010), 120-123.

Buekenhout, F.

  1. F. Buekenhout and P. J. Cameron, Projective and affine geometry over division rings, pp. 27-62 in Handbook of Incidence Geometry (ed. F. Buekenhout), Elsevier, Amsterdam, 1995.

Bussemaker, F. C.

  1. F. C. Bussemaker, P. J. Cameron, J. J. Seidel and S. V. Tsaranov, Tables of Signed Graphs, Technical Report 91-WSK-01, Eindhoven University of Technology, 1991.

Calderbank, A. R.

  1. A. R. Calderbank, P. J. Cameron, W. M. Kantor and J. J. Seidel, Z4-Kerdock codes, orthogonal spreads, and extremal Euclidean line systems, Proc. London Math. Soc. (3) 75 (1997), 436-480.

Calkin, N. J.

  1. N. J. Calkin and P. J. Cameron, Almost odd random sum-free sets, Combinatorics, Probability and Computing 7 (1998), 27-32.

Cannon, J. J.

  1. P. J. Cameron and J. J. Cannon, Fast recognition of doubly transitive groups, J. Symbolic Comput. 12 (1991), 459-474.

Cara, Ph.

  1. P. J. Cameron and Ph. Cara, Independent generating sets and geometries for symmetric groups, J. Algebra 258 (2002), 641-650; doi: 10.1016/S0021-8693(02)00550-1

Castillo-Ramirez, A.

  1. P. J. Cameron, A. Castillo-Ramirez, M. Gadouleau and J. D. Mitchell, Lengths of words in transformation semigroups generated by digraphs, J. Algebraic Combinatorics 45 (2017), 149-170; doi: 10.1007/s10801-016-0703-9

Chetwynd, A. G.

  1. 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 Math. 50 (1984), 71-97.
  2. P. J. Cameron, A. M. Chetwynd and J. J. Watkins, Decomposition of snarks, J. Graph Theory 11 (1987), 13-19.

Cilleruelo, J.

  1. P. J. Cameron, J. Cilleruelo and O. Serra, On monochromatic solutions of equations in groups, Revista Matemática Iberoamericana 23 (2007), 385-395.

Cioabă, S.

  1. A graph partition problem, Amer. Math. Monthly, to appear.

Cohen, A. M.

  1. P. J. Cameron and A. M. Cohen, On the number of fixed point free elements in a permutation group, in: A Collection of Contributions in Honour of Jack van Lint (ed. P. J. Cameron and H. C. A. van Tilborg), Topics in Discrete Math. 7, North-Holland, Amsterdam, 1992, pp. 135-138.

Connelly, R.

  1. R. A. Bailey, P. J. Cameron and R. Connelly, Sudoku, gerechte designs, resolutions, affine space, spreads, reguli, and Hamming codes, American Math. Monthly 115 (2008), 383-404.

Cooter, S.

  1. C. Budd, P. Cameron, S. Cooter and D. Spiegelhalter, The making of To Infinity and Beyond!, Mathematics Today 46 (2010), 120-123.

Dang, A. N.

  1. P. J. Cameron, A. N. Dang and S. Riis, Guessing games on triangle-free graphs, Electronic J. Combinatorics 23(1) (2016), paper #1.48.

Daykin, D. E.

  1. 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 Math. 50 (1984), 71-97.

Delić, D.

  1. A. Bonato, P. J. Cameron and D. Delić, Tournaments and orders with the pigeonhole property, Canadian Math. Bull. 43 (2000), 397-405.
  2. A. Bonato, P. J. Cameron, D. Delić and S. Thomassé, Generalized pigeonhole properties of graphs and oriented graphs, European J. Combinatorics 23 (2002), 257-274.

Delsarte, Ph.

  1. P. J. Cameron, P. Delsarte and J.-M. Goethals) Hemisystems, orthogonal configurations, and dissipative conference matrices, Philips J. Res. 34 (1979), 147-162.

Denniston, R. H. F.

  1. P. J. Cameron and R. H. F. Denniston, A partition system, Ars Combinatoria 4 (1977), 285-287.

Dent, A. W.

  1. P. J. Cameron and A. W. Dent, Orbit-homogeneity in permutation groups, Bull. London Math. Soc. 38 (2006), 597-606; doi: 10.1112/S0024609306018601

Deza, M.

  1. P. J. Cameron and M. Deza, On permutation geometries, J. London Math. Soc. (2) 20 (1979), 373-386.
  2. L. Babai, P. J. Cameron, M. Deza and N. M. Singhi, On sharply edge-transitive permutation groups, J. Algebra 73 (1981), 573-585.
  3. P. J. Cameron, M. Deza and P. Frankl, Sharp sets of permutations, J. Algebra 111 (1987), 220-247.
  4. P. J. Cameron, M. Deza and N. M. Singhi, Infinite geometric groups and sets, pp. 54-61 in Algebraic, Extremal and Metric Combinatorics (ed. M.-M. Deza, P. Frankl and I. G. Rosenberg), LMS Lecture Notes 131, Cambridge Univ. Press, Cambridge, 1988.
  5. P. J. Cameron, M. Deza and P. Frankl, Intersection theorems in permutation groups, Combinatorica 8 (1988), 249-260.
  6. P. J. Cameron and M. Deza, Designs and Matroids, in Handbook of Combinatorial Designs, 2nd edition (ed. C. J. Colbourn and J. Dinitz), Discrete Mathematics and its Applications 42, Chapman & Hall/CRC, 2006, Chapter VII.10 (pp.847-851); ISBN: 1584885068.

Dobcsányi, P.

  1. P. J. Cameron, P. Dobcsányi, J. P. Morgan and L. H. Soicher, The External Representation of Block Designs, version 1.1, 2003.
  2. R. A. Bailey, P. J. Cameron, P. Dobcsányi, J. P. Morgan, and L. H. Soicher, Designs on the Web, Discrete Math. 306 (2006), 3014-3027; doi: 10.1016/j.disc.2004.10.027

Dobson, T.

  1. J. Araújo, J. P. Araújo, P. J. Cameron, T. Dobson, A. Hulpke and P. Lopes, Imprimitive permutations in primitive groups, J. Algebra 486 (2017), 396-416; doi: 10.1016/j.jalgebra.2017.03.043

Drake, D. A.

  1. P. J. Cameron and D. A. Drake, Partial lambda-geometries of small nexus, Ann. Discrete Math. 6 (1980), 19-29.

Erdős, P.

  1. P. J. Cameron and P. Erdős, On the number of sets of integers with various properties, Number Theory (ed. R. A. Mollin), 61-79, de Gruyter, Berlin, 1990.
  2. P. J. Cameron and P. Erdős, Notes on sum-free and related sets, Combinatorics, Probability and Computing 8 (1999), 95-107.

Fairbairn, B.

  1. P. J. Cameron, B. Fairbairn and M. Gadouleau, Computing in permutation groups without memory, Chicago J. Theor. Computer Sci. Vol 2014, paper 7; doi: 10.4086/cjtcs.2014.007
  2. P. J. Cameron, B. Fairbairn and M. Gadouleau, Computing in matrix groups without memory, Chicago J. Theor. Computer Sci. Vol 2014, paper 8; doi: 10.4086/cjtcs.2014.008

Fernandes, M. E.

  1. Peter J. Cameron, Maria Elisa Fernandes, Dimitri Leemans and Mark Mixer, String C-groups as transitive subgroups of Sym(n), J. Algebra 447 (2016), 468-478; doi: 10.1016/j.jalgebra.2015.09.040
  2. Peter J. Cameron, Maria Elisa Fernandes, Dimitri Leemans and Mark Mixer, Highest rank of a polytope for An, Proc. London Math. Soc. 115 (2017), 135-176; doi: 10.1112/plms.12039

Filipiak, K.

  1. R. A. Bailey, P. J. Cameron, K. Filipiak, J. Kunert and A. Markiewicz, On optimality and construction of circular repeated-measurements designs, Statistica Sinica 27 (2017), 1-22; doi: 10.5705/ss.202015.0045

Fisher, P. H.

  1. P. J. Cameron and P.H. Fisher, Small extended generalized quadrangles, Europ. J. Combinatorics 11 (1990), 403-413.

Fon-Der-Flaass, D. G.

  1. P. J. Cameron and D. G. Fon-Der-Flaass, Bases for permutation groups and matroids, Europ. J. Combinatorics 16 (1995), 537-544.
  2. P. J. Cameron and D. G. Fon-Der-Flaass, Orbits of antichains revisited, Europ. J. Combinatorics 16 (1995), 545-554.

Frankl, P.

  1. P. J. Cameron, M. Deza and P. Frankl, Sharp sets of permutations, J. Algebra 111 (1987), 220-247.
  2. P. J. Cameron, M. Deza and P. Frankl, Intersection theorems in permutation groups, Combinatorica 8 (1988), 249-260.
  3. P. J. Cameron, P. Frankl and W. M. Kantor, Intersecting families of finite sets and fixed-point-free 2-elements, Europ. J. Combinatorics 10 (1989), 149-160.

Gadouleau, M.

  1. P. J. Cameron and M. Gadouleau, Remoteness of permutation codes, European J. Combinatorics 33 (2012), 1273-1285; doi: 10.1016/j.ejc.2012.03.027
  2. P. J. Cameron, M. Gadouleau and S. Riis, Combinatorial representations, J. Combinatorial Theory (A) 120 (2013), 671-682; doi: 10.1016/j.jcta.2012.12.002
  3. P. J. Cameron, B. Fairbairn and M. Gadouleau, Computing in permutation groups without memory, Chicago J. Theor. Computer Sci. Vol 2014, paper 7; doi: 10.4086/cjtcs.2014.007
  4. P. J. Cameron, B. Fairbairn and M. Gadouleau, Computing in matrix groups without memory, Chicago J. Theor. Computer Sci. Vol 2014, paper 8; doi: 10.4086/cjtcs.2014.008
  5. P. J. Cameron, M. Gadouleau, J. D. Mitchell and Y. Peresse, Chains of subsemigroups, Israel J. Math.; doi: 10.1007/s11856-017-1523-x
  6. P. J. Cameron, A. Castillo-Ramirez, M. Gadouleau and J. D. Mitchell, Lengths of words in transformation semigroups generated by digraphs, J. Algebraic Combinatorics 45 (2017), 149-170; doi: 10.1007/s10801-016-0703-9

Gateva-Ivanova, T.

  1. Tatiana Gateva-Ivanova and Peter Cameron, Multipermutation solutions of the Yang–Baxter equation, Comm. Math. Phys. 309 (2012), 589-631.

Gewurz, D.

  1. P. J. Cameron, D. Gewurz and F. Merola, Product action, Discrete Math. 308 (2008), 386-394; doi: 10.1016/j.disc.2006.11.054

Ghinelli, D.

  1. P. J. Cameron and D. Ghinelli, Tubes of even order and flat pi.C2 geometries, Geometriae Dedicata 55 (1995), 265-278.

Ghosh, S.

  1. P. J. Cameron and S. Ghosh, On the power graph of a finite group, Discrete Math. 311 (2011), 1220-1222; doi: 10.1016/j.disc.2010.02.011

Giudici, M.

  1. P. J. Cameron, M. Giudici, G. A. Jones, W. M. Kantor, M. H. Klin, D. Marušič and L. A. Nowitz, Transitive permutation groups without semiregular subgroups, J. London Math. Soc. (2) 66 (2002), 325-333.

Goethals, J.-M.

  1. P. J. Cameron, J.-M. Goethals, J. J. Seidel and E. E. Shult, Line graphs, root systems and elliptic geometry, J. Algebra 43 (1976), 305-327.
  2. P. J. Cameron, J.-M. Goethals and J. J. Seidel, The Krein condition, spherical designs, Norton algebras and permutation groups, Proc. Kon. Nederl. Akad. Wetensch. (A) 81 (1978), 196-206.
  3. P. J. Cameron, J.-M. Goethals and J. J. Seidel, Strongly regular graphs having strongly regular subconstituents, J. Algebra 55 (1978), 257-280.
  4. P. J. Cameron, P. Delsarte and J.-M. Goethals, Hemisystems, orthogonal configurations, and dissipative conference matrices, Philips J. Res. 34 (1979), 147-162.

Haemers, W. H.

  1. A. E. Brouwer, P. J. Cameron, W. H. Haemers and D. A. Preece, Self-dual, not self-polar, Discrete Math. 306 (2006), 3051-3053; doi: 10.1016/j.disc.2004.11.027

Hall, J. I.

  1. P. J. Cameron, J. I. Hall, J. H. van Lint, T. A. Springer and H. C. A. van Tilborg, Translates of subgroups of the multiplicative group of a finite field, Proc. Kon. Nederl. Akad. Wetensch. (A) 78 (1975), 285-289.
  2. P. J. Cameron and J. I. Hall, Some groups generated by transvection subgroups, J. Algebra, 140 (1991), 184-209.

Hilton, A. J. W.

  1. 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 Math. 50 (1984), 71-97.
  2. P. J. Cameron, A. J. W. Hilton and E. R. Vaughan, An analogue of Ryser's Theorem for partial Sudoku squares, J. Combinatorial Math. Combinatorial Comput. 80 (2012), 47-69.

Hirschfeld, J. W. P.

  1. P. J. Cameron, J. W. P. Hirschfeld and D. R. Hughes (editors), Finite Geometries and Designs, London Math. Soc. Lecture Notes 49, Cambridge Univ. Press, Cambridge, 1981.

Hodges, W. A.

  1. P. J. Cameron and W. A. Hodges, Some combinatorics of imperfect information, J. Symbolic Logic 66 (2001), 673-684.

Holroyd, F. C.

  1. 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 Math. 50 (1984), 71-97.

Hughes, D. R.

  1. P. J. Cameron, J. W. P. Hirschfeld and D. R. Hughes (editors), Finite Geometries and Designs, London Math. Soc. Lecture Notes 49, Cambridge Univ. Press, Cambridge, 1981.
  2. P. J. Cameron, D. R. Hughes and A. Pasini, Extended generalized quadrangles, Geometriae Dedicata 35 (1990), 193-228.

A. Hulpke

  1. J. Araújo, J. P. Araújo, P. J. Cameron, T. Dobson, A. Hulpke and P. Lopes, Imprimitive permutations in primitive groups, J. Algebra 486 (2017), 396-416; doi: 10.1016/j.jalgebra.2017.03.043

Iyudu, N.

  1. P. J. Cameron and N. Iyudu, Graphs of relations and Hilbert series, J. Symbolic Comput. 42 (2007), 1066-1078; doi: 10.1016/j.jsc.2007.07.006

Jackson, B.

  1. P. J. Cameron, B. Jackson and J. Rudd, Orbit-counting polynomials for graphs and codes, Discrete Math. 308 (2008), 920-930; doi: 10.1016/j.disc.2007.07.108

Johannsen, D.

  1. Peter J. Cameron, Daniel Johannsen, Thomas Prellberg and Pascal Schweitzer, Counting defective parking functions, Electronic J. Combinatorics 15(1) (2008), #R92 (15pp).

Johnson, C. R.

  1. P. J. Cameron and C. R. Johnson, The number of equivalence classes of symmetric sign patterns, Discrete Math. 306 (2006), 3074-3077; doi: 10.1016/j.disc.2004.10.0 29

Johnson, K. W.

  1. P. J. Cameron and K. W. Johnson, An investigation of countable B-groups, Math. Proc. Cambridge Philos. Soc. 102 (1987), 223-232.

Jones, G. A.

  1. P. J. Cameron, M. Giudici, G. A. Jones, W. M. Kantor, M. H. Klin, D. Marušič and L. A. Nowitz, Transitive permutation groups without semiregular subgroups, J. London Math. Soc. (2) 66 (2002), 325-333.

Kahn, J.

  1. E. E. Bannai, P. J. Cameron and J. Kahn, Nonexistence of certain distance-transitive digraphs, J. Combinatorial Theory (B) 31 (1981), 105-110.

Kang, M.

  1. P. J. Cameron, M. Kang and D. Stark, Random preorders and alignments, Discrete Math. 310 (2010), 591-603; doi: 10.1016/j.disc.2009.04.021

Kantor, W. M.

  1. P. J. Cameron and W. M. Kantor, Rank 3 groups and biplanes, J. Combinatorial Theory (A) 24 (1978), 1-23.
  2. P. J. Cameron and W. M. Kantor, 2-transitive and antiflag transitive collineation groups of finite projective spaces, J. Algebra 60 (1979), 384-422.
  3. P. J. Cameron, P. Frankl and W. M. Kantor, Intersecting families of finite sets and fixed-point-free 2-elements, Europ. J. Combinatorics 10 (1989), 149-160.
  4. P. J. Cameron and W. M. Kantor, Random permutations: Some group-theoretic aspects, Combinatorics, Probability and Computing 2 (1993), 257-262.
  5. A. R. Calderbank, P. J. Cameron, W. M. Kantor and J. J. Seidel, Z4-Kerdock codes, orthogonal spreads, and extremal Euclidean line systems, Proc. London Math. Soc. (3) 75 (1997), 436-480.
  6. P. J. Cameron, M. Giudici, G. A. Jones, W. M. Kantor, M. H. Klin, D. Marušič and L. A. Nowitz, Transitive permutation groups without semiregular subgroups, J. London Math. Soc. (2) 66 (2002), 325-333.

Kataoka, T.

  1. P. J. Cameron, T. Kataoka and M. Kiyota, Sharp characters of finite groups of type {-1,1}, J. Algebra 152 (1992), 248-258.

Kayibi, K. K.

  1. P. J. Cameron and K. K. Kayibi, Orbital chromatic and flow roots, Combinatorics, Probability and Computing 16 (2007), 401-407; doi: 10.1017/S0963548306008200

Kiyota, M.

  1. P. J. Cameron and M. Kiyota, Sharp characters of finite groups, J. Algebra 115 (1988), 125-143.
  2. P. J. Cameron, T. Kataoka and M. Kiyota, Sharp characters of finite groups of type {-1,1}, J. Algebra 152 (1992), 248-258.

Klin, M. H.

  1. P. J. Cameron, M. Giudici, G. A. Jones, W. M. Kantor, M. H. Klin, D. Marušič and L. A. Nowitz, Transitive permutation groups without semiregular subgroups, J. London Math. Soc. (2) 66 (2002), 325-333.

Knarr, N.

  1. P. J. Cameron and N. Knarr, Tubes in PG(3,q), Europ. J. Combinatorics 27 (2006), 114-124; doi: 10.1016/j.ejc.2004.07.001

Korchmàros, G.

  1. P. J. Cameron and G. Korchmàros, One-factorizations of complete graphs with a doubly transitive automorphism group, Bull. London Math. Soc. 25 (1993), 1-6.

Kovács, L. G.

  1. P. J. Cameron, L. G. Kovács, M. F. Newman and C. E. Praeger, Fixed-point-free permutations in transitive permutation groups of prime power order, Quart. J. Math. Oxford (2) 36 (1985), 273-278.

Krattenthaler, C.

  1. Peter J. Cameron, Christian Krattenthaler and Thomas W. Müller, Decomposable functors and the exponential principle, II, Séminaire Lotharingien de Combinatoire 61A (2010), Article B61Am.
  2. Peter J. Cameron, Christian Krattenthaler and Thomas W. Müller, A note on higher-dimensional magic matrices, Australasian J. Combinatorics, to appear

Ku, C. Y.

  1. P. J. Cameron and C. Y. Ku, Intersecting families of permutations, Europ. J. Combinatorics 24 (2003), 881-890.

Kunert, J.

  1. R. A. Bailey, P. J. Cameron, K. Filipiak, J. Kunert and A. Markiewicz, On optimality and construction of circular repeated-measurements designs, Statistica Sinica 27 (2017), 1-22; doi: 10.5705/ss.202015.0045

Kusuma, J.

  1. P. J. Cameron, J. Kusuma and P. Solé, Z4-codes and their Gray map images as orthogonal arrays, Designs, Codes, Crypt. 84 (2017), 109-114; doi: 10.1007/s10623-016-0225-4

Laflamme, C.

  1. P. J. Cameron, C. Laflamme, M. Pouzet, S. Tarzi and R. E. Woodrow) Overgroups of the automorphism group of the Rado graph, Asymptotic Geometric Analysis (ed. Monika Ludwig, Vitali D. Milman, Vladimir Pestov, and Nicole Tomczak-Jaegermann), Fields Institute Communications 68, Springer, 2013, pp. 45-54, ISBN 978-1-4614-6405-1

Leemans, D.

  1. Peter J. Cameron, Maria Elisa Fernandes, Dimitri Leemans and Mark Mixer, String C-groups as transitive subgroups of Sym(n), J. Algebra, 447 (2016), 468-478; doi: 10.1016/j.jalgebra.2015.09.040
  2. Peter J. Cameron, Maria Elisa Fernandes, Dimitri Leemans and Mark Mixer, Highest rank of a polytope for An, Proc. London Math. Soc. 115 (2017), 135-176; doi: 10.1112/plms.12039

Liebler, R. A.

  1. P. J. Cameron and R. A. Liebler, Tactical decompositions and orbits of projective groups, Linear Algebra Appl. 46 (1982), 91-102.

van Lint, J. H.

  1. P. J. Cameron and J. H. van Lint, Graph Theory, Coding Theory and Block Designs, London Math. Soc. Lecture Notes 19, Cambridge Univ. Press, Cambridge, 1975.
  2. P. J. Cameron, J. I. Hall, J. H. van Lint, T. A. Springer and H. C. A. van Tilborg, Translates of subgroups of the multiplicative group of a finite field, Proc. Kon. Nederl. Akad. Wetensch. (A) 78 (1975), 285-289.
  3. P. J. Cameron and J. H. van Lint, Graphs, Codes and Designs, London Math. Soc. Lecture Notes 43, Cambridge Univ. Press, Cambridge, 1980.
  4. P. J. Cameron and J. H. van Lint, On the partial geometry pg(6, 6, 2), J. Combinatorial Theory (A) 32 (1982), 252-255.
  5. P. J. Cameron and J. H. van Lint, Graphs, Codes, Designs and their Links, London Math. Soc. Student Texts 22, Cambridge Univ. Press, 1991.

Lockett, D.

  1. P. J. Cameron and D. Lockett, Posets, homomorphisms and homogeneity, Discrete Math. 310 (2010), 604-613; doi: 10.1016/j.disc.2009.04.027

P. Lopes

  1. J. Araújo, J. P. Araújo, P. J. Cameron, T. Dobson, A. Hulpke and P. Lopes, Imprimitive permutations in primitive groups, J. Algebra 486 (2017), 396-416; doi: 10.1016/j.jalgebra.2017.03.043

Lucchini, A.

  1. P. J. Cameron, A. Lucchini and C. M. Roney-Dougal, Generating sets for finite groups, Trans. Amer. Math. Soc., in press.

Macpherson, H. D.

  1. P. J. Cameron and H. D. Macpherson, Rank three permutation groups with rank three subconstituents, J. Combinatorial Theory (B) 39 (1985), 1-16.

Maimani, H. R.

  1. P. J. Cameron, H. R. Maimani, G. R. Omidi and B. Tayfeh-Rezaie, 3-designs from PSL(2,q), Discrete Math. 306 (2006), 3063-3073; doi: 10.1016/j.disc.2005.06.04 1

Majid, S.

  1. P. J. Cameron and S. Majid, Braided line and counting fixed points of GL(d,Fq), Communications in Algebra 31 (2003), 2003-2013.

Markiewicz, A.

  1. R. A. Bailey, P. J. Cameron, K. Filipiak, J. Kunert and A. Markiewicz, On optimality and construction of circular repeated-measurements designs, Statistica Sinica 27 (2017), 1-22; doi: 10.5705/ss.202015.0045

Martins, C.

  1. P. J. Cameron and C. Martins, A theorem on reconstructing random graphs, Combinatorics, Probability and Computing 2 (1993), 1-9.

Marušič, D.

  1. P. J. Cameron, M. Giudici, G. A. Jones, W. M. Kantor, M. H. Klin, D. Marušič and L. A. Nowitz, Transitive permutation groups without semiregular subgroups, J. London Math. Soc. (2) 66 (2002), 325-333.

Mason, J. H.

  1. 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 Math. 50 (1984), 71-97.

Mazzocca, F.

  1. P. J. Cameron and F. Mazzocca, Bijections which preserve blocking sets, Geometriae Dedicata 21 (1986), 219-229.
  2. P. J. Cameron, F. Mazzocca and R. Meshulam, Dual blocking sets in projective and affine planes. Geom. Dedicata 27 (1988), 203-207.

Merola, F.

  1. P. J. Cameron, D. Gewurz and F. Merola, Product action, Discrete Math. 308 (2008), 386-394; doi: 10.1016/j.disc.2006.11.054

Meshulam, R.

  1. P. J. Cameron, F. Mazzocca and R. Meshulam, Dual blocking sets in projective and affine planes. Geom. Dedicata 27 (1988), 203-207.

Mitchell, J.

  1. J. Araújo, P. J. Cameron, J. D. Mitchell and M. Neunhöffer, The classification of normalizing groups, J. Algebra 373 (2013), 481-490: doi: 10.1016/j.jalgebra.2012.08.033
  2. P. J. Cameron, M. Gadouleau, J. D. Mitchell and Y. Peresse, Chains of subsemigroups, Israel J. Math.; doi: 10.1007/s11856-017-1523-x
  3. P. J. Cameron, A. Castillo-Ramirez, M. Gadouleau and J. D. Mitchell, Lengths of words in transformation semigroups generated by digraphs, J. Algebraic Combinatorics 45 (2017), 149-170; doi: 10.1007/s10801-016-0703-9

Mixer, M.

  1. Peter J. Cameron, Maria Elisa Fernandes, Dimitri Leemans and Mark Mixer, String C-groups as transitive subgroups of Sym(n), J. Algebra, 447 (2016), 468-478; doi: 10.1016/j.jalgebra.2015.09.040
  2. Peter J. Cameron, Maria Elisa Fernandes, Dimitri Leemans and Mark Mixer, Highest rank of a polytope for An, Proc. London Math. Soc. 115 (2017), 135-176; doi: 10.1112/plms.12039

Montanaro, Ashley

  1. Peter J. Cameron, Ashley Montanaro, Michael W. Newman, Simone Severini and Andreas Winter, On the quantum chromatic number of a graph, Electronic Journal of Combinatorics 14(1) (2007), #R82 (15pp).

Morgan, J. P.

  1. P. J. Cameron, P. Dobcsányi, J. P. Morgan and L. H. Soicher, The External Representation of Block Designs, version 1.1, 2003.
  2. R. A. Bailey, P. J. Cameron, P. Dobcsányi, J. P. Morgan, and L. H. Soicher, Designs on the Web, Discrete Math. 306 (2006), 3014-3027; doi: 10.1016/j.disc.2004.10.027

Morgan, Kerri

  1. Peter J. Cameron and Kerri Morgan, Algebraic properties of chromatic roots, Electronic J. Combinatorics 24(1) (2017), paper #P1.21

Müller, Peter

  1. A. Bohn, P. J. Cameron and P. Müller, Galois groups of multivariate Tutte polynomials, J. Algebraic Combinatorics, in press; doi: 10.1007/s10801-011-0332-2

Müller, T. W.

  1. P. J. Cameron and T. W. Müller, A cohomological property of p-groups, Archiv der Mathematik 82 (2004), 200-204; doi: 10.1007/s00013-003-4865-z
  2. P. J. Cameron and T. W. Müller, A descent principle in modular subgroup arithmetic, J. Pure Appl. Algebra 203 (2005), 189-203; doi: 10.1016/j.jpaa.2005.03.013
  3. Peter J. Cameron, Christian Krattenthaler and Thomas W. Müller, Decomposable functors and the exponential principle, II, Séminaire Lotharingien de Combinatoire 61A (2010), Article B61Am.
  4. Peter J. Cameron, Christian Krattenthaler and Thomas W. Müller, A note on higher-dimensional magic matrices, Australasian J. Combinatorics, to appear

Nelson, R.

  1. 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 Math. 50 (1984), 71-97.

Nešetřil, J.

  1. P. J. Cameron and J. Nešetřil, Homomorphism-homogeneous relational structures, Combinatorics, Probability and Computing 15 (2006), 91-103; doi: 10.1017/S0963548305007091

Neumann, P. M.

  1. P. J. Cameron, P. M. Neumann and J. Saxl, An interchange property in finite permutation groups, Bull. London Math. Soc. 11 (1979), 161-169.
  2. P. J. Cameron, P. M. Neumann and D. N. Teague, On the degrees of primitive permutation groups, Math. Z. 180 (1982), 141-149.
  3. P. J. Cameron, P. M. Neumann and J. Saxl, On groups with no regular orbits on the set of subsets, Arch. Math. 43 (1984), 295-296.

Neunhöffer, M.

  1. J. Araújo, P. J. Cameron, J. D. Mitchell and M. Neunhöffer, The classification of normalizing groups, J. Algebra 373 (2013), 481-490: doi: 10.1016/j.jalgebra.2012.08.033

Newman, M. F.

  1. P. J. Cameron, L. G. Kovács, M. F. Newman and C. E. Praeger, Fixed-point-free permutations in transitive permutation groups of prime power order, Quart. J. Math. Oxford (2) 36 (1985), 273-278.

Newman, M. W.

  1. Peter J. Cameron, Ashley Montanaro, Michael W. Newman, Simone Severini and Andreas Winter, On the quantum chromatic number of a graph, Electronic Journal of Combinatorics 14(1) (2007), #R82 (15pp).

Nikandish, R.

  1. Ghodratallah Aalipour, Saieed Akbari, Peter J. Cameron, Reza Nikandish and Farzad Shaveisi, On the structure of the power graph and the enhanced power graph of a group, Electronic J. Combinatorics 24(3) (2017), P3.16

Nilson, T.

  1. T. Nilson and P. J. Cameron, Triple arrays from difference sets, J. Combinatorial Designs; doi 10.1002/jcd.21569

Nowitz, L. A.

  1. P. J. Cameron, M. Giudici, G. A. Jones, W. M. Kantor, M. H. Klin, D. Marušič and L. A. Nowitz, Transitive permutation groups without semiregular subgroups, J. London Math. Soc. (2) 66 (2002), 325-333.

Odlyzko, A. M.

  1. E. A. Bender, P. J. Cameron, A. M. Odlyzko and L. B. Richmond, Connectedness, classes and cycle index, Combinatorics, Probability and Computing 8 (1999), 31-43.

Omidi, G. R.

  1. P. J. Cameron, H. R. Maimani, G. R. Omidi and B. Tayfeh-Rezaie, 3-designs from PSL(2,q), Discrete Math. 306 (2006), 3063-3073; doi: 10.1016/j.disc.2005.06.04 1
  2. P. J. Cameron, G. R. Omidi and B. Tayfeh-Rezaie, 3-designs from PGL(2,q), Electronic J. Combinatorics 13 (2006), #R50 (11pp.)

Pálfy, P. P.

  1. L. Babai, P. J. Cameron and P. P. Pálfy, On the orders of primitive groups with bounded non-abelian composition factors, J. Algebra 79 (1982), 161-168.

Pasini, A.

  1. P. J. Cameron, D. R. Hughes and A. Pasini, Extended generalized quadrangles, Geometriae Dedicata 35 (1990), 193-228.

Payne, S. E.

  1. P. J. Cameron, S. E. Payne and J. A. Thas, Polarities of generalized hexagons and perfect codes, Geometriae Dedicata 5 (1976), 525-528.

Peresse, Y.

  1. P. J. Cameron, M. Gadouleau, J. D. Mitchell and Y. Peresse, Chains of subsemigroups, Israel J. Math.; doi: 10.1007/s11856-017-1523-x

Pouzet, M.

  1. P. J. Cameron, C. Laflamme, M. Pouzet, S. Tarzi and R. E. Woodrow) Overgroups of the automorphism group of the Rado graph, Asymptotic Geometric Analysis (ed. Monika Ludwig, Vitali D. Milman, Vladimir Pestov, and Nicole Tomczak-Jaegermann), Fields Institute Communications 68, Springer, 2013, pp. 45-54, ISBN 978-1-4614-6405-1

Praeger, C. E.

  1. P. J. Cameron and C. E. Praeger, Graphs and permutation groups with projective subconstituents, J. London Math. Soc. (2) 25 (1982), 62-74.
  2. P. J. Cameron, C. E. Praeger, J. Saxl and G. M. Seitz, On the Sims conjecture and distance-transitive graphs, Bull. London Math. Soc. 15 (1983), 499-506.
  3. P. J. Cameron and C. E. Praeger, On 2-arc transitive graphs of girth 4, J. Combinatorial Theory (B) 35 (1983), 1-11.
  4. P. J. Cameron, L. G. Kovács, M. F. Newman and C. E. Praeger, Fixed-point-free permutations in transitive permutation groups of prime power order, Quart. J. Math. Oxford (2) 36 (1985), 273-278.
  5. P. J. Cameron and C. E. Praeger, Partitioning into Steiner systems, pp. 61-71 in Combinatorics '88 (ed. A. Barlotti et al.), Mediterranean Press, Roma, 1992.
  6. P. J. Cameron and C. E. Praeger, Block-transitive t-designs, I: point-imprimitive designs, Discrete Math. 118 (1993), 33-43.
  7. P. J. Cameron and C. E. Praeger, Block-transitive t-designs, II: large t, Finite Geometry and Combinatorics (ed. A. Beutelspacher et al.), Cambridge Univ. Press, 1993.
  8. P. J. Cameron, C. E. Praeger and N. C. Wormald, Highly arc-transitive digraphs and universal covering digraphs, Combinatorica 13 (1993), 1-21.
  9. P. J. Cameron and C. E. Praeger, Constructing flag-transitive, point-imprimitive designs, J. Algebraic Combinatorics 43 (2016), 755-769; doi: 10.1007/s10801-015-0591-4

Preece, D. A.

  1. P. J. Cameron and D. A. Preece, Some new fully-balanced Graeco-Latin Youden "squares", Utilitas Math. 8 (1975), 193-204.
  2. A. E. Brouwer, P. J. Cameron, W. H. Haemers and D. A. Preece, Self-dual, not self-polar, Discrete Math. 306 (2006), 3051-3053; doi: 10.1016/j.disc.2004.11.027

Prellberg, T.

  1. P. J. Cameron, T. Prellberg and D. Stark, Asymptotic enumeration of incidence matrices, Journal of Physics: Conference Series 42 (2006), 59-70; doi: 10.1088/1742-6596/42/1/00 7
  2. P. J. Cameron, T. Prellberg and D. Stark, Asymptotics for incidence matrix classes, Electronic J. Combinatorics 13 (2006), #R85 (19pp.)
  3. Peter J. Cameron, Daniel Johannsen, Thomas Prellberg and Pascal Schweitzer, Counting defective parking functions, Electronic J. Combinatorics 15(1) (2008), #R92 (15pp).
  4. P. J. Cameron, T. Prellberg and D. Stark, Asymptotic enumeration of 2-covers and line graphs, Discrete Math. 310 (2010), 230-240; doi: 10.1016/j.disc.2008.09.008

Richmond, L. B.

  1. E. A. Bender, P. J. Cameron, A. M. Odlyzko and L. B. Richmond, Connectedness, classes and cycle index, Combinatorics, Probability and Computing 8 (1999), 31-43.
  2. J. P. Bell, E. A. Bender, P. J. Cameron and L. B. Richmond, Asymptotics for the probability of connectedness and the distribution of number of components, Electronic J. Combinatorics 7(1) (2000), article #R33.

Riis, S.

  1. P. J. Cameron, S. Riis and T. Wu, On the guessing number of shift graphs, J. Discrete Algorithms 7 (2009), 220-226; doi: 10.1016/j.jda.2008.09.009
  2. P. J. Cameron, M. Gadouleau and S. Riis, Combinatorial representations, J. Combinatorial Theory (A) 120 (2013), 671-682; doi: 10.1016/j.jcta.2012.12.002
  3. P. J. Cameron, A. N. Dang and S. Riis, Guessing games on triangle-free graphs, Electronic J. Combinatorics 23(1) (2016), paper #1.48.

Roney-Dougal, C. M.

  1. P. J. Cameron, A. Lucchini and C. M. Roney-Dougal, Generating sets for finite groups, Trans. Amer. Math. Soc., in press.

Rowley, C. A.

  1. 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 Math. 50 (1984), 71-97.

Royle, G. F.

  1. J. Araújo, W. Bentz, P. J. Cameron, G. F. Royle, and A. Schaefer, Primitive groups, graph endomorphisms and synchronization, Proc. London Math. Soc 113 (2016), 829-867; doi: 10.1112/plms/pdw040

Rudd, J.

  1. P. J. Cameron, B. Jackson and J. Rudd, Orbit-counting polynomials for graphs and codes, Discrete Math. 308 (2008), 920-930; doi: 10.1016/j.disc.2007.07.108

Rudvalis, A.

  1. P. J. Cameron and A. Rudvalis, A design and a geometry for the group F22, Designs, Codes, Crypt., in press; doi: 10.1007/s10623-007-9041-1

Saxl, J.

  1. P. J. Cameron, P. M. Neumann and J. Saxl, An interchange property in finite permutation groups, Bull. London Math. Soc. 11 (1979), 161-169.
  2. P. J. Cameron and J. Saxl, Permuting unordered subsets, Quart. J. Math. Oxford (2) 34 (1983), 167-170.
  3. P. J. Cameron, P. M. Neumann and J. Saxl, On groups with no regular orbits on the set of subsets, Arch. Math. 43 (1984), 295-296.
  4. P. J. Cameron, C. E. Praeger, J. Saxl and G. M. Seitz, On the Sims conjecture and distance-transitive graphs, Bull. London Math. Soc. 15 (1983), 499-506.

Schaefer, A.

  1. J. Araújo, W. Bentz, P. J. Cameron, G. F. Royle, and A. Schaefer, Primitive groups, graph endomorphisms and synchronization, Proc. London Math. Soc 113 (2016), 829-867; doi: 10.1112/plms/pdw040

Schweitzer, P.

  1. Peter J. Cameron, Daniel Johannsen, Thomas Prellberg and Pascal Schweitzer, Counting defective parking functions, Electronic J. Combinatorics 15(1) (2008), #R92 (15pp).

Seidel, J. J.

  1. P. J. Cameron and J. J. Seidel, Quadratic forms over GF(2), Proc. Kon. Nederl. Akad. Wetensch. (A) 76 (1973), 1-8.
  2. P. J. Cameron, J.-M. Goethals, J. J. Seidel and E. E. Shult, Line graphs, root systems and elliptic geometry, J. Algebra 43 (1976), 305-327.
  3. P. J. Cameron, J.-M. Goethals and J. J. Seidel, The Krein condition, spherical designs, Norton algebras and permutation groups, Proc. Kon. Nederl. Akad. Wetensch. (A) 81 (1978), 196-206.
  4. P. J. Cameron, J.-M. Goethals and J. J. Seidel, Strongly regular graphs having strongly regular subconstituents, J. Algebra 55 (1978), 257-280.
  5. F. C. Bussemaker, P. J. Cameron, J. J. Seidel and S. V. Tsaranov, Tables of Signed Graphs, Technical Report 91-WSK-01, Eindhoven University of Technology, 1991.
  6. P. J. Cameron, J. J. Seidel and S. V. Tsaranov, Signed graphs, root lattices and Coxeter groups, J. Algebra 164 (1994), 173-209.
  7. A. R. Calderbank, P. J. Cameron, W. M. Kantor and J. J. Seidel, Z4-Kerdock codes, orthogonal spreads, and extremal Euclidean line systems, Proc. London Math. Soc. (3) 75 (1997), 436-480.

Seitz, G. M.

  1. P. J. Cameron, C. E. Praeger, J. Saxl and G. M. Seitz, On the Sims conjecture and distance-transitive graphs, Bull. London Math. Soc. 15 (1983), 499-506.

Serra, O.

  1. P. J. Cameron, J. Cilleruelo and O. Serra, On monochromatic solutions of equations in groups, Revista Matemática Iberoamericana 23 (2007), 385-395.

Severini, S.

  1. Peter J. Cameron, Ashley Montanaro, Michael W. Newman, Simone Severini and Andreas Winter, On the quantum chromatic number of a graph, Electronic Journal of Combinatorics 14(1) (2007), #R82 (15pp).

Shaveisi, F.

  1. Ghodratallah Aalipour, Saieed Akbari, Peter J. Cameron, Reza Nikandish and Farzad Shaveisi, On the structure of the power graph and the enhanced power graph of a group, Electronic J. Combinatorics 24(3) (2017), P3.16

Sheehan, J.

  1. P. J. Cameron, J. Sheehan and P. Spiga, Semiregular automorphisms of vertex-transitive cubic graphs, Europ. J. Combinatorics 27 (2006), 924-930; doi: 10.1016/j.ejc.2005.04.008

Shult, E. E.

  1. P. J. Cameron, J.-M. Goethals, J. J. Seidel and E. E. Shult, Line graphs, root systems and elliptic geometry, J. Algebra 43 (1976), 305-327.

Singhi, N. M.

  1. L. Babai, P. J. Cameron, M. Deza and N. M. Singhi, On sharply edge-transitive permutation groups, J. Algebra 73 (1981), 573-585.
  2. P. J. Cameron, M. Deza and N. M. Singhi, Infinite geometric groups and sets, pp. 54-61 in Algebraic, Extremal and Metric Combinatorics (ed. M.-M. Deza, P. Frankl and I. G. Rosenberg), LMS Lecture Notes 131, Cambridge Univ. Press, Cambridge, 1988.

Soicher, L. H.

  1. P. J. Cameron, P. Dobcsányi, J. P. Morgan and L. H. Soicher, The External Representation of Block Designs, version 1.1, 2003.
  2. R. A. Bailey, P. J. Cameron, P. Dobcsányi, J. P. Morgan, and L. H. Soicher, Designs on the Web, Discrete Math. 306 (2006), 3014-3027; doi: 10.1016/j.disc.2004.10.027
  3. P. J. Cameron and L. H. Soicher, Block intersection polynomials, Bull. London Math. Soc. 39 (2007), 559-564; doi: 10.1112/blms/bdm034

Solé, P.

  1. P. J. Cameron, J. Kusuma and P. Solé, Z4-codes and their Gray map images as orthogonal arrays, Designs, Codes, Crypt. 84 (2017), 109-114; doi: 10.1007/s10623-016-0225-4

Solomon, R.

  1. P. J. Cameron, R. Solomon and A. Turull, Chains of subgroups in symmetric groups, J. Algebra 127 (1989), 340-352.

Spiegelhalter, D.

  1. C. Budd, P. Cameron, S. Cooter and D. Spiegelhalter, The making of To Infinity and Beyond!, Mathematics Today 46 (2010), 120-123.

Spiga, P.

  1. P. J. Cameron, J. Sheehan and P. Spiga, Semiregular automorphisms of vertex-transitive cubic graphs, Europ. J. Combinatorics 27 (2006), 924-930; doi: 10.1016/j.ejc.2005.04.008
  2. P. J. Cameron and P. Spiga, Min-wise independent families with respect to any linear order, Communications in Algebra 35 (2007), 3026-3033; doi: 10.1080/00927870701404812
  3. P. J. Cameron and P. Spiga, Most switching classes with primitive automorphism groups contain graphs with trivial groups, Australasian J. Combinatorics 62 (2015), 76-90.

Springer, T. A.

  1. P. J. Cameron, J. I. Hall, J. H. van Lint, T. A. Springer and H. C. A. van Tilborg, Translates of subgroups of the multiplicative group of a finite field, Proc. Kon. Nederl. Akad. Wetensch. (A) 78 (1975), 285-289.

Stark, D.

  1. P. J. Cameron and D. Stark, A prolific construction of graphs with the n-e.c. property, Electronic J. Combinatorics 9(1) (2002), #R31 (12pp).
  2. P. J. Cameron, T. Prellberg and D. Stark, Asymptotic enumeration of incidence matrices, Journal of Physics: Conference Series 42 (2006), 59-70; doi: 10.1088/1742-6596/42/1/007
  3. P. J. Cameron, T. Prellberg and D. Stark, Asymptotics for incidence matrix classes, Electronic J. Combinatorics 13 (2006), #R85 (19pp.)
  4. P. J. Cameron, M. Kang and D. Stark, Random preorders and alignments, Discrete Math. 310 (2010), 591-603; doi: 10.1016/j.disc.2009.04.021
  5. P. J. Cameron, T. Prellberg and D. Stark, Asymptotic enumeration of 2-covers and line graphs, Discrete Math. 310 (2010), 230-240; doi: 10.1016/j.disc.2008.09.008

Steinberg, B.

  1. J. Araújo, P. J. Cameron and B. Steinberg, Between primitive and 2-transitive: synchronization and its friends, Europ. Math. Soc. Surveys, in press

Szabó, C.

  1. P. J. Cameron and C. Szabó, Independence algebras, J. London Math. Soc. (2) 61 (2000), 321-334.

Tarzi, S.

  1. P. J. Cameron and S. Tarzi, Switching with more than two colours, Europ. J. Combinatorics 25 (2004), 169-177; doi: 10.1016/S0195-6698(03)00097-0
  2. P. J. Cameron and S. Tarzi, Limits of cubes, Topology and its Applications 155 (2008), 1454-1461; doi: 10.1016/j.topol.2008.03.022
  3. P. J. Cameron, C. Laflamme, M. Pouzet, S. Tarzi and R. E. Woodrow) Overgroups of the automorphism group of the Rado graph, Asymptotic Geometric Analysis (ed. Monika Ludwig, Vitali D. Milman, Vladimir Pestov, and Nicole Tomczak-Jaegermann), Fields Institute Communications 68, Springer, 2013, pp. 45-54, ISBN 978-1-4614-6405-1

Tayfeh-Reziae, B.

  1. P. J. Cameron, H. R. Maimani, G. R. Omidi and B. Tayfeh-Rezaie, 3-designs from PSL(2,q), Discrete Math. 306 (2006), 3063-3073; doi: 10.1016/j.disc.2005.06.041
  2. P. J. Cameron, G. R. Omidi and B. Tayfeh-Rezaie, 3-designs from PGL(2,q), Electronic J. Combinatorics 13 (2006), #R50 (11pp.)

Taylor, D. E.

  1. P. J. Cameron and D. E. Taylor, Stirling numbers and affine equivalence, Ars Combinatoria 20B (1985), 3-14.

Teague, D. N.

  1. P. J. Cameron, P. M. Neumann and D. N. Teague, On the degrees of primitive permutation groups, Math. Z. 180 (1982), 141-149.

Thas, J. A.

  1. P. J. Cameron, S. E. Payne and J. A. Thas, Polarities of generalized hexagons and perfect codes, Geometriae Dedicata 5 (1976), 525-528.
  2. A. Blokhuis, P. J. Cameron and J. A. Thas, On a generalization of a theorem of B. Segre, Geometriae Dedicata 43 (1992), 299-305.

Thomas, S.

  1. P. J. Cameron and S. Thomas, Groups acting on unordered sets, Proc. London Math. Soc. (3) 59 (1989), 541-557.

Thomassé, S.

  1. A. Bonato, P. J. Cameron, D. Delić and S. Thomassé, Generalized pigeonhole properties of graphs and oriented graphs, European J. Combinatorics 23 (2002), 257-274.

van Tilborg, H. C. A.

  1. P. J. Cameron, J. I. Hall, J. H. van Lint, T. A. Springer and H. C. A. van Tilborg, Translates of subgroups of the multiplicative group of a finite field, Proc. Kon. Nederl. Akad. Wetensch. (A) 78 (1975), 285-289.
  2. P. J. Cameron and H. C. A. van Tolborg (editors), A Collection of Contributions in Honour of Jack van Lint, Topics in Discrete Math. 7, North-Holland, Amsterdam, 1992.

Tsaranov, S.

  1. F. C. Bussemaker, P. J. Cameron, J. J. Seidel and S. V. Tsaranov, Tables of Signed Graphs, Technical Report 91-WSK-01, Eindhoven University of Technology, 1991.
  2. P. J. Cameron, J. J. Seidel and S. V. Tsaranov, Signed graphs, root lattices and Coxeter groups, J. Algebra 164 (1994), 173-209.

Turull, A.

  1. P. J. Cameron, R. Solomon and A. Turull, Chains of subgroups in symmetric groups, J. Algebra 127 (1989), 340-352.

Vaughan, E. R.

  1. P. J. Cameron, A. J. W. Hilton and E. R. Vaughan, An analogue of Ryser's Theorem for partial Sudoku squares, J. Combinatorial Math. Combinatorial Comput. 80 (2012), 47-69.

Vershik, A. M.

  1. P. J. Cameron and A. M. Vershik, Some isometry groups of the Urysohn space, Ann. Pure Appl. Logic 143 (2006), 70-78; doi: 10.1016/j.apal.2005.08.001

Wanless, I. M.

  1. P. J. Cameron and I. M. Wanless, Covering radius for sets of permutations, Discrete Math. 293 (2005), 91-109; doi: 10.1016/j.disc.2004.08.024
  2. J. M. Browning, P. J. Cameron and I. M. Wanless, Bounds on the number of small Latin subsquares, J. Combinatorial Theory (A) 124 (2014), 41-56; doi: 10.1016/j.jcta.2014.01.002

Watkins, J. J.

  1. P. J. Cameron, A. M. Chetwynd and J. J. Watkins, Decomposition of snarks, J. Graph Theory 11 (1987), 13-19.

Webb, B. S.

  1. P. J. Cameron and B. S. Webb, Infinite designs, in Handbook of Combinatorial Designs, 2nd edition (ed. C. J. Colbourn and J. Dinitz), Discrete Mathematics and its Applications 42, Chapman & Hall/CRC, 2006, Chapter VI.30 (pp.504-505); ISBN: 1584885068.
  2. P. J. Cameron and B. S. Webb, Perfect countably infinite Steiner triple systems, Australasian J. Combinatorics 54 (2012), 273-278.

Wells, A. L. Jr.

  1. P. J. Cameron and A. L. Wells Jr., Signatures and signed switching classes, J. Combinatorial Theory (B) 40 (1986), 344-361.

West, D. B.

  1. P. J. Cameron and D. B. West (editors), Research problems from the 20th British Combinatorial Conference, Discrete Math,, 308 (2008), 621-630; doi: 10.1016/j.disc.2007.07.021

Wilson, R. J.

  1. L. W. Beineke, P. J. Cameron and R. J. Wilson, Introduction, in Topics in Algebraic Graph Theory (ed. L. W. Beineke and R. J. Wilson), Cambridge Univ. Press, Cambridge, 2004 (ISBN 0521801974), pp.1-29.

Winter, A.

  1. Peter J. Cameron, Ashley Montanaro, Michael W. Newman, Simone Severini and Andreas Winter, On the quantum chromatic number of a graph, Electronic Journal of Combinatorics 14(1) (2007), #R82 (15pp).

Woodall, D. R.

  1. 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 Math. 50 (1984), 71-97.

Woodrow, R. E.

  1. P. J. Cameron, C. Laflamme, M. Pouzet, S. Tarzi and R. E. Woodrow) Overgroups of the automorphism group of the Rado graph, Asymptotic Geometric Analysis (ed. Monika Ludwig, Vitali D. Milman, Vladimir Pestov, and Nicole Tomczak-Jaegermann), Fields Institute Communications 68, Springer, 2013, pp. 45-54, ISBN 978-1-4614-6405-1

Wormald, N. C.

  1. P. J. Cameron, C. E. Praeger and N. C. Wormald, Highly arc-transitive digraphs and universal covering digraphs, Combinatorica 13 (1993), 1-21.

Wu, T.

  1. P. J. Cameron and T. Wu, The complexity of the weight problem for permutation groups, Electr. Notes Discrete Math. 28 (2007), 109-116; doi: 10.1016/j.endm.2007.0 1.034
  2. P. J. Cameron and T.Wu, The complexity of the weight problem for permutation and matrix groups, Discrete Math. 310 (2010), 408-416; doi: 10.1016/j.disc.2009.03.005
  3. C. Buchheim, P. J. Cameron and T. Wu, On the subgroup distance problem, Discrete Math. 309 (2009), 962-968; doi: 10.1016/j.disc.2008.01.036
  4. P. J. Cameron, S. Riis and T. Wu, On the guessing number of shift graphs, J. Discrete Algorithms 7 (2009), 220-226; doi: 10.1016/j.jda.2008.09.009

Peter J. Cameron
3 February 2017