@article{Cameron:1996aa,
    Abstract = {The main theme of this article is that counting orbits of an infinite permutation group on finite subsets or tuples is very closely related to combinatorial enumeration; this point of view ties together various disparate ``stories''. Among these are reconstruction problems, the relation between connected and arbitrary graphs, the enumeration of N-free posets, and some of the combinatorics of Stirling numbers.},
    Author = {Cameron, Peter J.},
    Date = {1996/05/01},
    File = {Stories about Groups and Sequences - cameron1996.pdf},
    ISBN = {1573-7586},
    Journal = {Designs, Codes and Cryptography},
    Number = {1},
    Pages = {109--133},
    Title = {Stories about groups and sequences},
    URL = {https://doi.org/10.1007/BF00130572},
    Volume = {8},
    Year = {1996},
    bdsk-url-1 = {https://doi.org/10.1007/BF00130572},
    date-added = {2023-08-18 11:02:09 +0200},
    date-modified = {2023-08-18 11:02:10 +0200},
    id = {Cameron1996},
    doi = {10.1007/BF00130572}
}

@article{Cameron:1996aa, Abstract = {The main theme of this article is that counting orbits of an infinite permutation group on finite subsets or tuples is very closely related to combinatorial enumeration; this point of view ties together various disparate ``stories''. Among these are reconstruction problems, the relation between connected and arbitrary graphs, the enumeration of N-free posets, and some of the combinatorics of Stirling numbers.}, Author = {Cameron, Peter J.}, Date = {1996/05/01}, File = {Stories about Groups and Sequences - cameron1996.pdf}, ISBN = {1573-7586}, Journal = {Designs, Codes and Cryptography}, Number = {1}, Pages = {109--133}, Title = {Stories about groups and sequences}, URL = {https://doi.org/10.1007/BF00130572}, Volume = {8}, Year = {1996}, bdsk-url-1 = {https://doi.org/10.1007/BF00130572}, date-added = {2023-08-18 11:02:09 +0200}, date-modified = {2023-08-18 11:02:10 +0200}, id = {Cameron1996}, doi = {10.1007/BF00130572} }