Conference on Combinatorial Mathematics
University of Oxford, 3-7 July 1972
List of talks:
- N. Biggs,
Pictures
- P. J. Cameron,
Questions about symmetric designs
- S. L. G. Choi,
Some combinatorial problems in number theory
- E. J. Cockayne (speaker) and D. G. Schiller,
Computation of Steiner minimal trees
- D. E. Daykin (speaker) and A. Brace,
Sperner type theorems for finite sets
- F. D. J. Dunstan, A. W. Ingleton and D. J. A. Welsh,
Supermatroids
- P. Erdős (speaker) and A. Hajnal,
On Ramsey like theorems. Problems and results
- H. O. Foulkes,
Characters of symmetric groups induced by characters of cyclic
subgroups
- F. Harary (speaker), P. O'Neil, R. C. Read and A. J. Schwenk,
The number of trees in a wheel
- A. P. Heron,
Matroid polynomials
- A. J. W. Hilton,
The number of spanning trees of labelled wheels, fans and
baskets
- J. H. Mason,
Matroids: Unimodal conjectures and Motzkin's Theorem
- G. H. J. Meredith,
Some families of non-hamiltonian graphs
- G. H. J. Meredith and E. K. Lloyd,
The Hamiltonian graphs O4 to O7
- C. St-J. A. Nash-Williams,
Which infinite set-systems have transversals - a possible
approach
- J. Sheehan,
Smoothly embeddable subgraphs - a survey
- C. A. B. Smith,
Electric currents in regular matroids
- H. N. V. Temperley,
The enumeration of graphs on large periodic lattices
- R. J. Wilson,
On the adjacency matrix of a graph
- D. R. Woodall,
Property B and the four-colour problem
- D. R. Woodall,
Two results on infinite transversals
Back to the British Combinatorial
Conferences
page.