Peter J. Cameron

Peter J. Cameron: Dixon's theorem and random synchronization. Discrete Mathematics 313(11): 1233-1236 (2013)

Peter J. Cameron, Maximilien Gadouleau, Søren Riis: Combinatorial representations. J. Comb. Theory, Ser. A 120(3): 671-682 (2013)

Peter J. Cameron, Maximilien Gadouleau: Remoteness of permutation codes. Eur. J. Comb. 33(6): 1273-1285 (2012)

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

Peter J. Cameron: Research problems from the BCC22. Discrete Mathematics 311(13): 1074-1083 (2011)

Peter J. Cameron, Shamik Ghosh: The power graph of a finite group. Discrete Mathematics 311(13): 1220-1222 (2011)

Peter J. Cameron, Thomas Prellberg, Dudley Stark: Asymptotic enumeration of 2-covers and line graphs. Discrete Mathematics 310(2): 230-240 (2010)

Peter J. Cameron: Research Problems from the BCC21. Discrete Mathematics 310(2): 347-354 (2010)

Peter J. Cameron, Taoyang Wu: The complexity of the weight problem for permutation and matrix groups. Discrete Mathematics 310(3): 408-416 (2010)

Peter J. Cameron, Mihyun Kang, Dudley Stark: Random preorders and alignments. Discrete Mathematics 310(3): 591-603 (2010)

Peter J. Cameron, Deborah C. Lockett: Posets, homomorphisms and homogeneity. Discrete Mathematics 310(3): 604-613 (2010)

Peter J. Cameron: Permutation codes. Eur. J. Comb. 31(2): 482-490 (2010)

Peter J. Cameron: Problems from CGCS Luminy, May 2007. Eur. J. Comb. 31(2): 644-648 (2010)

Christoph Buchheim, Peter J. Cameron, Taoyang Wu: On the subgroup distance problem. Discrete Mathematics 309(4): 962-968 (2009)

Peter J. Cameron: Decompositions of complete multipartite graphs. Discrete Mathematics 309(12): 4185-4186 (2009)

Peter J. Cameron: A generalisation of t-designs. Discrete Mathematics 309(14): 4835-4842 (2009)

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

Peter J. Cameron, Daniel Johannsen, Thomas Prellberg, Pascal Schweitzer: Counting Defective Parking Functions. Electr. J. Comb. 15(1) (2008)

Peter J. Cameron, Daniele A. Gewurz, Francesca Merola: Product action. Discrete Mathematics 308(2-3): 386-394 (2008)

Peter J. Cameron, Bill Jackson, Jason D. Rudd: Orbit-counting polynomials for graphs and codes. Discrete Mathematics 308(5-6): 920-930 (2008)

R. A. Bailey, Peter J. Cameron, Robert Connelly: Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes. The American Mathematical Monthly 115(5): 383-404 (2008)

Peter J. Cameron, Ashley Montanaro, Michael W. Newman, Simone Severini, Andreas Winter: On the Quantum Chromatic Number of a Graph. Electr. J. Comb. 14(1) (2007)

Peter J. Cameron, Koko Kalambay Kayibi: Orbital Chromatic and Flow Roots. Combinatorics, Probability & Computing 16(3): 401-407 (2007)

Peter J. Cameron, A. Rudvalis: A design and a geometry for the group Fi ₂₂. Des. Codes Cryptography 44(1-3): 11-14 (2007)

R. A. Bailey, Peter J. Cameron: What is a design? How should we classify them? Des. Codes Cryptography 44(1-3): 223-238 (2007)

Peter J. Cameron, Taoyang Wu: The complexity of the Weight Problem for permutation groups. Electronic Notes in Discrete Mathematics 28: 109-116 (2007)

Peter J. Cameron, Natalia Iyudu: Graphs of relations and Hilbert series. J. Symb. Comput. 42(11-12): 1066-1078 (2007)

Peter J. Cameron, A. M. Vershik: Some isometry groups of the Urysohn space. Ann. Pure Appl. Logic 143(1-3): 70-78 (2006)

Peter J. Cameron, G. R. Omidi, Behruz Tayfeh-Rezaie: 3-Designs from PGL(2, q). Electr. J. Comb. 13(1) (2006)

Peter J. Cameron, Thomas Prellberg, Dudley Stark: Asymptotics for Incidence Matrix Classes. Electr. J. Comb. 13(1) (2006)

Peter J. Cameron, Jaroslav Nesetril: Homomorphism-Homogeneous Relational Structures. Combinatorics, Probability & Computing 15(1-2): 91-103 (2006)

R. A. Bailey, Peter J. Cameron, Peter Dobcsányi, John P. Morgan, Leonard H. Soicher: Designs on the web. Discrete Mathematics 306(23): 3014-3027 (2006)

Andries E. Brouwer, Peter J. Cameron, Willem H. Haemers, Donald A. Preece: Self-dual, not self-polar. Discrete Mathematics 306(23): 3051-3053 (2006)

Peter J. Cameron, Hamid Reza Maimani, G. R. Omidi, Behruz Tayfeh-Rezaie: 3-Designs from PSL(2, q). Discrete Mathematics 306(23): 3063-3073 (2006)

Peter J. Cameron, Charles R. Johnson: The number of equivalence classes of symmetric sign patterns. Discrete Mathematics 306(23): 3074-3077 (2006)

Peter J. Cameron: Research problems from the 2003 IPM Workshop. Discrete Mathematics 306(23): 3174-3179 (2006)

Peter J. Cameron, Norbert Knarr: Tubes in PG(3, q). Eur. J. Comb. 27(1): 114-124 (2006)

Peter J. Cameron, John Sheehan, Pablo Spiga: Semiregular automorphisms of vertex-transitive cubic graphs. Eur. J. Comb. 27(6): 924-930 (2006)

Christoph Buchheim, Peter J. Cameron, Taoyang Wu: On the Subgroup Distance Problem. Electronic Colloquium on Computational Complexity (ECCC) 13(146) (2006)

Peter J. Cameron: Tribute. Discrete Mathematics 291(1-3): 3- (2005)

Peter J. Cameron: The random graph has the strong small index property. Discrete Mathematics 291(1-3): 41-43 (2005)

Peter J. Cameron: Partitions and permutations. Discrete Mathematics 291(1-3): 45-54 (2005)

Peter J. Cameron, Ian M. Wanless: Covering radius for sets of permutations. Discrete Mathematics 293(1-3): 91-109 (2005)

Peter J. Cameron: Research problems from the 19th British Combinatorial Conference. Discrete Mathematics 293(1-3): 313-320 (2005)

Peter J. Cameron, Sam Tarzi: Switching with more than two colours. Eur. J. Comb. 25(2): 169-177 (2004)

Priscila P. Alejandro, R. A. Bailey, Peter J. Cameron: Association schemes and permutation groups. Discrete Mathematics 266(1-3): 47-67 (2003)

Peter J. Cameron: Multi-letter Youden rectangles from quadratic forms. Discrete Mathematics 266(1-3): 143-151 (2003)

Peter J. Cameron: Research problems from the 18th British Combinatorial Conference. Discrete Mathematics 266(1-3): 441-451 (2003)

Peter J. Cameron: Random strongly regular graphs? Discrete Mathematics 273(1-3): 103-114 (2003)

Peter J. Cameron, C. Y. Ku: Intersecting families of permutations. Eur. J. Comb. 24(7): 881-890 (2003)

Peter J. Cameron: Cycle Index, Weight Enumerator, and Tutte Polynomial. Electr. J. Comb. 9(1) (2002)

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

Peter J. Cameron: Homogeneous Permutations. Electr. J. Comb. on(2) (2002)

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

Peter J. Cameron: Random strongly regular graphs? Electronic Notes in Discrete Mathematics 10: 54-63 (2001)

Peter J. Cameron, Wilfrid Hodges: Some Combinatorics of Imperfect Information. J. Symb. Log. 66(2): 673-684 (2001)

László Babai, Peter J. Cameron: Automorphisms and Enumeration of Switching Classes of Tournaments. Electr. J. Comb. 7 (2000)

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

Peter J. Cameron: Some counting problems related to permutation groups. Discrete Mathematics 225(1-3): 77-92 (2000)

Peter J. Cameron: Homogeneous Cayley Objects. Eur. J. Comb. 21(6): 745-760 (2000)

Peter J. Cameron: Problems on Discrete Metric Spaces. Eur. J. Comb. 21(6): 831-838 (2000)

Peter J. Cameron: SGDs with doubly transitive automorphism group. Journal of Graph Theory 32(3): 229-233 (1999)

Neil J. Calkin, Peter J. Cameron: Almost Odd Random Sum-Free Sets. Combinatorics, Probability & Computing 7(1): 27-32 (1998)

Peter J. Cameron: A census of infinite distance-transitive graphs. Discrete Mathematics 192(1-3): 11-26 (1998)

Peter J. Cameron: On the probability of connectedness. Discrete Mathematics 167-168: 175-187 (1997)

Peter J. Cameron: Stories about Groups and Sequences. Des. Codes Cryptography 8(1-2): 109-133 (1996)

Peter J. Cameron: Metric and Topological Aspects of the Symmetric Group of Countable Degree. Eur. J. Comb. 17(2-3): 135-142 (1996)

Peter J. Cameron: Counting Two-graphs Related to Trees. Electr. J. Comb. 2 (1995)

Peter J. Cameron: An orbit theorem for Steiner triple systems. Discrete Mathematics 125(1-3): 97-100 (1994)

Peter J. Cameron: Two-graphs and trees. Discrete Mathematics 127(1-3): 63-74 (1994)

Peter J. Cameron: Infinite linear spaces. Discrete Mathematics 129(1-3): 29-41 (1994)

Peter J. Cameron, Cheryl E. Praeger, Nicholas C. Wormald: Infinite highly arc transitive digraphs and universal covering digraphs. Combinatorica 13(4): 377-396 (1993)

Peter J. Cameron, Cleide Martins: A Theorem on Reconstruction of Random Graphs. Combinatorics, Probability & Computing 2: 1-9 (1993)

Peter J. Cameron, William M. Kantor: Random Permutations: Some Group-Theoretic Aspects. Combinatorics, Probability & Computing 2: 257-262 (1993)

Peter J. Cameron, Cheryl E. Praeger: Block-transitive t-designs I: point-imprimitive designs. Discrete Mathematics 118(1-3): 33-43 (1993)

Peter J. Cameron: Almost all quasigroups have rank 2. Discrete Mathematics 106-107: 111-115 (1992)

Peter J. Cameron, Arjeh M. Cohen: On the number of fixed point free elements in a permutation group. Discrete Mathematics 106-107: 135-138 (1992)

Peter J. Cameron: Several 2-(46, 6, 3) designs. Discrete Mathematics 87(1): 89-90 (1991)

Peter J. Cameron: The age of a relational structure. Discrete Mathematics 95(1-3): 49-67 (1991)

Peter J. Cameron: Covers of graphs and EGQs. Discrete Mathematics 97(1-3): 83-92 (1991)

Peter J. Cameron, John J. Cannon: Fast Recognition of Doubly Transitive Groups. J. Symb. Comput. 12(4/5): 459-474 (1991)

Peter J. Cameron: Some sequences of integers. Discrete Mathematics 75(1-3): 89-102 (1989)

Peter J. Cameron, Michel Deza, Peter Frankl: Intersection theorems in permutation groups. Combinatorica 8(3): 249-260 (1988)

Peter J. Cameron: Regular orbits of permutation groups on the power set. Discrete Mathematics 62(3): 307-309 (1986)

Peter J. Cameron, Albert L. Wells Jr.: Signatures and signed switching classes. J. Comb. Theory, Ser. B 40(3): 344-361 (1986)

Peter J. Cameron: Cyclic automorphisms of a countable graph and random sum-free sets. Graphs and Combinatorics 1(1): 129-135 (1985)

Peter J. Cameron, H. D. Macpherson: Rank three permutation groups with rank three subconstituents. J. Comb. Theory, Ser. B 39(1): 1-16 (1985)

Peter J. Cameron, Cheryl E. Praeger: On 2-arc transitive graphs of girth 4. J. Comb. Theory, Ser. B 35(1): 1-11 (1983)

Peter J. Cameron: There are only finitely many finite distance-transitive graphs of given valency greater than two. Combinatorica 2(1): 9-13 (1982)

Peter J. Cameron, Jack H. van Lint: On the Partial Geometry pg(6, 6, 2). J. Comb. Theory, Ser. A 32(2): 252-255 (1982)

Peter J. Cameron: Normal subgroups of infinite multiply transitive permutation groups. Combinatorica 1(4): 343-347 (1981)

Peter J. Cameron: 6-Transitive graphs. J. Comb. Theory, Ser. B 28(2): 168-179 (1980)

Peter J. Cameron, William M. Kantor: Rank 3 Groups and Biplanes. J. Comb. Theory, Ser. A 24(1): 1-23 (1978)

Peter J. Cameron: Automorphisms and cohomology of switching classes. J. Comb. Theory, Ser. B 22(3): 297-298 (1977)

Peter J. Cameron: Embedding Edge-Colored Complete Graphs in Binary Affine Spaces. J. Comb. Theory, Ser. A 21(2): 203-215 (1976)

Peter J. Cameron: Extending Symmetric Designs. J. Comb. Theory, Ser. A 14(2): 215-220 (1973)