• Publications
  • Influence
FINITE PERMUTATION GROUPS AND FINITE SIMPLE GROUPS
In the past two decades, there have been far-reaching developments in the problem of determining all finite non-abelian simple groups—so much so, that many people now believe that the solution to theExpand
  • 520
  • 34
Permutation Groups
  • 282
  • 26
  • PDF
Oligomorphic permutation groups
1. Introduction 2. Preliminaries 3. Examples and growth rates 4. Subgroups 5. Miscellaneous topics.
  • 284
  • 24
  • PDF
Strongly regular graphs
TLDR
Strongly regular graphs form an important class of graphs which lie somewhere between the highly structured and the apparently random. Expand
  • 194
  • 22
  • PDF
Homomorphism-Homogeneous Relational Structures
  • P. Cameron, J. Nesetril
  • Computer Science, Mathematics
  • Combinatorics, Probability and Computing
  • 1 January 2006
TLDR
We study relational structures (especially graphs and posets) which satisfy the analogue of homogeneity but for homomorphisms rather than isomorphisms. Expand
  • 70
  • 21
  • PDF
Combinatorics: Topics, Techniques, Algorithms
Preface 1. What is combinatorics? 2. On numbers and counting 3. Subsets, partitions, permutations 4. Recurrence relations and generating functions 5. The principle of inclusion and exclusion 6. LatinExpand
  • 326
  • 20
Some sequences of integers
  • P. Cameron
  • Computer Science, Mathematics
  • Discret. Math.
  • 1 September 1989
TLDR
We find that the same sequence of integers counts two families of things with no obvious connection, or that a simple translation connects the answers to two counting problems. Expand
  • 137
  • 20
  • PDF
Designs, graphs, codes, and their links
TLDR
A textbook on design theory, graph theory and coding theory in discrete mathematics . Expand
  • 385
  • 19
Orbits of antichains revisited
TLDR
We present a new treatment of the permutation f of antichains in ranked posets moving the set of lower units of a monotone Boolean function to theSet of its upper zeros. Expand
  • 60
  • 17
...
1
2
3
4
5
...