Extending Symmetric Designs. - Peter J. Cameron (J. Comb. Theory A, 1973)

Embedding Edge-Colored Complete Graphs in Binary Affine Spaces. - Peter J. Cameron (J. Comb. Theory A, 1976)

Automorphisms and cohomology of switching classes. - Peter J. Cameron (J. Comb. Theory B, 1977)

Rank 3 Groups and Biplanes. - Peter J. Cameron; William M. Kantor (J. Comb. Theory A, 1978)

On Graphs with Given Automorphism Group. - Peter J. Cameron (Eur. J. Comb., 1980)

6-Transitive graphs. - Peter J. Cameron (J. Comb. Theory B, 1980)

A note on generalized line graphs. - Peter J. Cameron (J. Graph Theory, 1980)

Normal subgroups of infinite multiply transitive permutation groups. - Peter J. Cameron (Comb., 1981)

Nonexistence of certain distance-transitive digraphs. - Eiichi Bannai; Peter J. Cameron; Jeff Kahn 001 (J. Comb. Theory B, 1981)

There are only finitely many finite distance-transitive graphs of given valency greater than two. - Peter J. Cameron (Comb., 1982)

On the Partial Geometry pg(6, 6, 2). - Peter J. Cameron; Jack H. van Lint (J. Comb. Theory A, 1982)

On 2-arc transitive graphs of girth 4. - Peter J. Cameron; Cheryl E. Praeger (J. Comb. Theory B, 1983)

Cyclic automorphisms of a countable graph and random sum-free sets. - Peter J. Cameron (Graphs Comb., 1985)

Rank three permutation groups with rank three subconstituents. - Peter J. Cameron; H. D. Macpherson (J. Comb. Theory B, 1985)

Regular orbits of permutation groups on the power set. - Peter J. Cameron (Discret. Math., 1986)

Signatures and signed switching classes. - Peter J. Cameron; Albert L. Wells Jr. (J. Comb. Theory B, 1986)

Some Permutation Representations of a Free Group. - Peter J. Cameron (Eur. J. Comb., 1987)

Digraphs Admitting Sharply Edge-transitive Automorphism Groups. - Peter J. Cameron (Eur. J. Comb., 1987)

Decomposition of snarks. - Peter J. Cameron; Amanda G. Chetwynd; John J. Watkins (J. Graph Theory, 1987)

Intersection theorems in permutation groups. - Peter J. Cameron; Michel Deza; Peter Frankl (Comb., 1988)

Some sequences of integers. - Peter J. Cameron (Discret. Math., 1989)

Intersecting Families of Finite Sets and Fixed-point-Free 2-Elements. - Peter J. Cameron; Peter Frankl; William M. Kantor (Eur. J. Comb., 1989)

Small Extended Generalized Quadrangles. - Peter J. Cameron; P. H. Fisher (Eur. J. Comb., 1990)

Several 2-(46, 6, 3) designs. - Peter J. Cameron (Discret. Math., 1991)

The age of a relational structure. - Peter J. Cameron (Discret. Math., 1991)

Covers of graphs and EGQs. - Peter J. Cameron (Discret. Math., 1991)

Fast Recognition of Doubly Transitive Groups. - Peter J. Cameron; John J. Cannon (J. Symb. Comput., 1991)

Almost all quasigroups have rank 2. - Peter J. Cameron (Discret. Math., 1992)

On the number of fixed point free elements in a permutation group. - Peter J. Cameron; Arjeh M. Cohen (Discret. Math., 1992)

Infinite geometric groups of rank 4. - Peter J. Cameron (Eur. J. Comb., 1992)

Infinite highly arc transitive digraphs and universal covering digraphs. - Peter J. Cameron; Cheryl E. Praeger; Nicholas C. Wormald (Comb., 1993)

Random Permutations: Some Group-Theoretic Aspects. - Peter J. Cameron; William M. Kantor (Comb. Probab. Comput., 1993)

A Theorem on Reconstruction of Random Graphs. - Peter J. Cameron; Cleide Martins (Comb. Probab. Comput., 1993)

Block-transitive t-designs I: point-imprimitive designs. - Peter J. Cameron; Cheryl E. Praeger (Discret. Math., 1993)

An orbit theorem for Steiner triple systems. - Peter J. Cameron (Discret. Math., 1994)

Two-graphs and trees. - Peter J. Cameron (Discret. Math., 1994)

Infinite linear spaces. - Peter J. Cameron (Discret. Math., 1994)

Counting Two-graphs Related to Trees. - Peter J. Cameron (Electron. J. Comb., 1995)

Bases for permutation groups and matroids. - Peter J. Cameron; Dmitry Fon-Der-Flaass (Eur. J. Comb., 1995)

Orbits of antichains revisited. - Peter J. Cameron; Dmitry Fon-Der-Flaass (Eur. J. Comb., 1995)

Stories about Groups and Sequences. - Peter J. Cameron (Des. Codes Cryptogr., 1996)

Metric and Topological Aspects of the Symmetric Group of Countable Degree. - Peter J. Cameron (Eur. J. Comb., 1996)

On the probability of connectedness. - Peter J. Cameron (Discret. Math., 1997)

Almost Odd Random Sum-Free Sets. - Neil J. Calkin; Peter J. Cameron (Comb. Probab. Comput., 1998)

A census of infinite distance-transitive graphs. - Peter J. Cameron (Discret. Math., 1998)

An extremal problem related to biplanes. - Peter J. Cameron (Australas. J Comb., 1999)

SGDs with doubly transitive automorphism group. - Peter J. Cameron (J. Graph Theory, 1999)

Automorphisms and Enumeration of Switching Classes of Tournaments. - László Babai; Peter J. Cameron (Electron. J. Comb., 2000)

Asymptotics for the Probability of Connectedness and the Distribution of Number of Components. - Jason P. Bell; Edward A. Bender; Peter J. Cameron; L. Bruce Richmond (Electron. J. Comb., 2000)

Some counting problems related to permutation groups. - Peter J. Cameron (Discret. Math., 2000)

Homogeneous Cayley Objects. - Peter J. Cameron (Eur. J. Comb., 2000)

Problems on Discrete Metric Spaces. - Peter J. Cameron (Eur. J. Comb., 2000)

Random strongly regular graphs? - Peter J. Cameron (Electron. Notes Discret. Math., 2001)

Some Combinatorics of Imperfect Information. - Peter J. Cameron; Wilfrid Hodges (J. Symb. Log., 2001)

Cycle Index, Weight Enumerator, and Tutte Polynomial. - Peter J. Cameron (Electron. J. Comb., 2002)

Homogeneous Permutations. - Peter J. Cameron (Electron. J. Comb., 2002)

A Prolific Construction of Strongly Regular Graphs with the n-e.c. Property. - Peter J. Cameron; Dudley Stark (Electron. J. Comb., 2002)

Generalized Pigeonhole Properties of Graphs and Oriented Graphs*1. - Anthony Bonato; Peter J. Cameron; Dejan Delic; Stéphan Thomassé (Eur. J. Comb., 2002)

Association schemes and permutation groups. - Priscila P. Alejandro; Rosemary A. Bailey; Peter J. Cameron (Discret. Math., 2003)

Multi-letter Youden rectangles from quadratic forms. - Peter J. Cameron (Discret. Math., 2003)

Research problems from the 18th British Combinatorial Conference. - Peter J. Cameron (Discret. Math., 2003)

Intersecting families of permutations. - Peter J. Cameron; Cheng Yeaw Ku (Eur. J. Comb., 2003)

Switching with more than two colours. - Peter J. Cameron; Sam Tarzi (Eur. J. Comb., 2004)

Tribute. - Peter J. Cameron (Discret. Math., 2005)

The random graph has the strong small index property. - Peter J. Cameron (Discret. Math., 2005)

Partitions and permutations. - Peter J. Cameron (Discret. Math., 2005)

Research problems from the 19th British Combinatorial Conference. - Peter J. Cameron (Discret. Math., 2005)

Covering radius for sets of permutations. - Peter J. Cameron; Ian M. Wanless (Discret. Math., 2005)

Some isometry groups of the Urysohn space. - Peter J. Cameron; Anatoly M. Vershik (Ann. Pure Appl. Log., 2006)

3-Designs from PGL(2, q). - Peter J. Cameron; G. R. Omidi; Behruz Tayfeh-Rezaie (Electron. J. Comb., 2006)

Asymptotics for Incidence Matrix Classes. - Peter J. Cameron; Thomas Prellberg; Dudley Stark (Electron. J. Comb., 2006)

Homomorphism-Homogeneous Relational Structures. - Peter J. Cameron; Jaroslav Nesetril (Comb. Probab. Comput., 2006)

Designs on the web. - Rosemary A. Bailey; Peter J. Cameron; Peter Dobcsányi; John P. Morgan; Leonard H. Soicher (Discret. Math., 2006)

Self-dual, not self-polar. - Andries E. Brouwer; Peter J. Cameron; Willem H. Haemers; Donald A. Preece (Discret. Math., 2006)

Research problems from the 2003 IPM Workshop. - Peter J. Cameron (Discret. Math., 2006)

The number of equivalence classes of symmetric sign patterns. - Peter J. Cameron; Charles R. Johnson (Discret. Math., 2006)

3-Designs from PSL(2, q). - Peter J. Cameron; Hamid Reza Maimani; G. R. Omidi; Behruz Tayfeh-Rezaie (Discret. Math., 2006)

On the Subgroup Distance Problem. - Christoph Buchheim; Peter J. Cameron; Taoyang Wu (Electron. Colloquium Comput. Complex., 2006)

Tubes in PG(3, q). - Peter J. Cameron; Norbert Knarr (Eur. J. Comb., 2006)

Semiregular automorphisms of vertex-transitive cubic graphs. - Peter J. Cameron; John Sheehan; Pablo Spiga (Eur. J. Comb., 2006)

On the Quantum Chromatic Number of a Graph. - Peter J. Cameron; Ashley Montanaro; Michael W. Newman; Simone Severini; Andreas J. Winter 002 (Electron. J. Comb., 2007)

Orbital Chromatic and Flow Roots. - Peter J. Cameron; Koko Kalambay Kayibi (Comb. Probab. Comput., 2007)

What is a design? How should we classify them? - Rosemary A. Bailey; Peter J. Cameron (Des. Codes Cryptogr., 2007)

A design and a geometry for the group Fi 22. - Peter J. Cameron; A. Rudvalis (Des. Codes Cryptogr., 2007)

The complexity of the Weight Problem for permutation groups. - Peter J. Cameron; Taoyang Wu (Electron. Notes Discret. Math., 2007)

Graphs of relations and Hilbert series. - Peter J. Cameron; Natalia Iyudu (J. Symb. Comput., 2007)

Counting Defective Parking Functions. - Peter J. Cameron; Daniel Johannsen; Thomas Prellberg; Pascal Schweitzer (Electron. J. Comb., 2008)

Product action. - Peter J. Cameron; Daniele A. Gewurz; Francesca Merola (Discret. Math., 2008)

Orbit-counting polynomials for graphs and codes. - Peter J. Cameron; Bill Jackson; Jason D. Rudd (Discret. Math., 2008)

Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes. - Rosemary A. Bailey; Peter J. Cameron; Robert Connelly (Am. Math. Mon., 2008)

Decompositions of complete multipartite graphs. - Peter J. Cameron (Discret. Math., 2009)

A generalisation of t-designs. - Peter J. Cameron (Discret. Math., 2009)

On the guessing number of shift graphs. - Taoyang Wu; Peter J. Cameron; Søren Riis (J. Discrete Algorithms, 2009)

Research Problems from the BCC21. - Peter J. Cameron (Discret. Math., 2010)

Random preorders and alignments. - Peter J. Cameron; Mihyun Kang; Dudley Stark (Discret. Math., 2010)

Posets, homomorphisms and homogeneity. - Peter J. Cameron; Deborah C. Lockett (Discret. Math., 2010)

Asymptotic enumeration of 2-covers and line graphs. - Peter J. Cameron; Thomas Prellberg; Dudley Stark (Discret. Math., 2010)

The complexity of the weight problem for permutation and matrix groups. - Peter J. Cameron; Taoyang Wu (Discret. Math., 2010)

Permutation codes. - Peter J. Cameron (Eur. J. Comb., 2010)

Problems from CGCS Luminy, May 2007. - Peter J. Cameron (Eur. J. Comb., 2010)

A note on higher-dimensional magic matrices. - Peter J. Cameron; Christian Krattenthaler; Thomas W. Müller (Australas. J Comb., 2011)

Research problems from the BCC22. - Peter J. Cameron (Discret. Math., 2011)

The power graph of a finite group. - Peter J. Cameron; Shamik Ghosh (Discret. Math., 2011)

Perfect countably infinite Steiner triple systems. - Peter J. Cameron; Bridget S. Webb (Australas. J Comb., 2012)

A Unifying Framework to Characterize the Power of a Language to Express Relations - Paola Bonizzoni; Peter J. Cameron; Gianluca Della Vedova; Alberto Leporati; Giancarlo Mauri (CoRR, 2012)

Remoteness of permutation codes. - Peter J. Cameron; Maximilien Gadouleau (Eur. J. Comb., 2012)

The Random Graph. - Peter J. Cameron (The Mathematics of Paul Erdős II, 2013)

Groups with right-invariant multiorders. - Peter J. Cameron (Australas. J Comb., 2013)

Dixon's theorem and random synchronization. - Peter J. Cameron (Discret. Math., 2013)

Combinatorial representations. - Peter J. Cameron; Maximilien Gadouleau; Søren Riis (J. Comb. Theory A, 2013)

Groups synchronizing a transformation of non-uniform kernel. - João Araújo 002; Wolfram Bentz; Peter J. Cameron (Theor. Comput. Sci., 2013)

Computing in Permutation Groups Without Memory. - Peter J. Cameron; Ben Fairbairn; Maximilien Gadouleau (Chic. J. Theor. Comput. Sci., 2014)

Computing in Matrix Groups Without Memory. - Peter J. Cameron; Ben Fairbairn; Maximilien Gadouleau (Chic. J. Theor. Comput. Sci., 2014)

Primitive groups synchronize non-uniform maps of extreme ranks. - João Araújo 002; Peter J. Cameron (J. Comb. Theory B, 2014)

Bounds on the number of small Latin subsquares. - Joshua Browning; Peter J. Cameron; Ian M. Wanless (J. Comb. Theory A, 2014)

Most switching classes with primitive automorphism groups contain graphs with trivial groups. - Peter J. Cameron; Pablo Spiga (Australas. J Comb., 2015)

Z4-codes and their Gray map images as orthogonal arrays. - Peter J. Cameron; Josephine Kusuma (CoRR, 2015)

A Graph Partition Problem. - Sebastian M. Cioaba; Peter J. Cameron (Am. Math. Mon., 2015)

Guessing Games on Triangle-Free Graphs. - Peter J. Cameron; Ntah Ahn Dang; Søren Riis (Electron. J. Comb., 2016)

On the Structure of the Power Graph and the Enhanced Power Graph of a Group. - Ghodratollah Aalipour; Saieed Akbari; Peter J. Cameron; Reza Nikandish 001; Farzad Shaveisi (Electron. J. Comb., 2017)

Algebraic Properties of Chromatic Roots. - Peter J. Cameron; Kerri Morgan (Electron. J. Comb., 2017)

ℤ4-codes and their Gray map images as orthogonal arrays. - Peter J. Cameron; Josephine Kusuma; Patrick Solé (Des. Codes Cryptogr., 2017)

The Cycle Polynomial of a Permutation Group. - Peter J. Cameron; Jason Semeraro (Electron. J. Comb., 2018)

Association schemes for diagonal groups. - Peter J. Cameron; Sean Eberhard (Australas. J Comb., 2019)

Smallest cyclically covering subspaces of Fqn, and lower bounds in Isbell's conjecture. - Peter J. Cameron; David Ellis; William Raynaud (Eur. J. Comb., 2019)

On the paper "Association schemes for diagonal groups". - Peter J. Cameron; Sean Eberhard (Australas. J Comb., 2020)

On the Connectivity and Independence Number of Power Graphs of Groups. - Peter J. Cameron; Sayyed Heidar Jafari (Graphs Comb., 2020)

Recent developments on the power graph of finite groups - a survey. - Ajay Kumar; Lavanya Selvaganesh; Peter J. Cameron; T. Tamizh Chelvam (AKCE Int. J. Graphs Comb., 2021)

The Non-Commuting, Non-Generating Graph of a Nilpotent Group. - Peter J. Cameron; Saul D. Freedman; Colva M. Roney-Dougal (Electron. J. Comb., 2021)

Forbidden Subgraphs of Power Graphs. - Pallabi Manna; Peter J. Cameron; Ranjit Mehatari (Electron. J. Comb., 2021)

Recognizing the Commuting Graph of a Finite Group. - Vikraman Arvind; Peter J. Cameron (CoRR, 2022)

Diagonal groups and arcs over groups. - Rosemary A. Bailey; Peter J. Cameron; Michael Kinyon; Cheryl E. Praeger (Des. Codes Cryptogr., 2022)

Super Graphs on Groups, I. - G. Arunkumar; Peter J. Cameron; Rajat Kanti Nath; Lavanya Selvaganesh (Graphs Comb., 2022)

Subgroup Sum Graphs of Finite Abelian Groups. - Peter J. Cameron; R. Raveendra Prathap; T. Tamizh Chelvam (Graphs Comb., 2022)

Enhanced power graphs are weakly perfect. - Peter J. Cameron; Veronica Phan (Australas. J Comb., 2023)

Minimum degrees of finite rectangular bands, null semigroups, and variants of full transformation semigroups. - Peter J. Cameron; James East; Desmond G. Fitzgerald; James D. Mitchell; Luke Pebody; Thomas Quinn-Gregson (Comb. Theory, 2023)

Induced subgraphs of zero-divisor graphs. - G. Arunkumar; Peter J. Cameron; T. Kavaskar 001; T. Tamizh Chelvam (Discret. Math., 2023)

Between the enhanced power graph and the commuting graph. - Peter J. Cameron; Bojan Kuzma (J. Graph Theory, 2023)

Solvable conjugacy class graph of groups. - Parthajit Bhowal; Peter J. Cameron; Rajat Kanti Nath; Benjamin Sambale (Discret. Math., 2023)

What can graphs and algebraic structures say to each other? - Peter J. Cameron (AKCE Int. J. Graphs Comb., 2024)

Super graphs on groups, II. - G. Arunkumar; Peter J. Cameron; Rajat Kanti Nath (Discret. Appl. Math., 2024)

On the difference of the enhanced power graph and the power graph of a finite group. - Sucharita Biswas; Peter J. Cameron; Angsuman Das; Hiranya Kishore Dey (J. Comb. Theory, Ser. A, 2024)

Component graphs of vector spaces and zero-divisor graphs of ordered sets. - Nilesh Khandekar; Peter J. Cameron; Vinayak Joshi (AKCE Int. J. Graphs Comb., 2025)

On the Order Sequence of a Group. - Peter J. Cameron; Hiranya Kishore Dey (Electron. J. Comb., 2025)

EPPA numbers of graphs. - David Bradley-Williams; Peter J. Cameron; Jan Hubicka; Matej Konecný (J. Comb. Theory B, 2025)