University of Cambridge, 13-17 August 1979

- D. Acketa,
*On the enumeration of matroids of rank 2 and a list of all matroids on at most 7 elements* - Jin Akiyama,
*Recent results on graph equations* - A. F. Alameddine,
*A counterexample to a theorem of Hakimi and Schmeichel* - Jaakko Astola,
*On perfect codes in the Lee-metric* - Peter Avery,
*The condition for a tournament score sequence to be simple* - A. Ball,
*Comma-free codes* - F. W. Barnes,
*Representing sets for non-harmonic rectangles* - David M. Berman (speaker) and M. O. Albertson,
*Critical graphs for the chromatic difference sequence* - T. Beth,
- A. Beutelspacher,
*Embedding of incidence structures in designs* - G. S. Bloom,
*Adjacency matrices of graceful graphs* - Béla Bollobás,
*Random graphs* - A. E. Brouwer,
*Delta spaces, generalized quadrangles and semipartial geometries* - Paul Catlin,
*Extremal graphs for the Hajnal-Szemerédi theorem* - D. V. Chopra,
*Some investigations on balanced and orthogonal arrays* - Conway,
- R. A. Cuninghame-Green,
*An algebra for the absolute centre of a graph* - I. Debroey,
*Equitransitive edge-to-edge tiling by regular convex polygons* - De Clerck,
- Walter Deuber,
*Partition theorems for structures* - M. Deza (speaker) and N. Hamada,
*The geometric structure of a matroid-design derived from a commutative Moufang loop and a new association scheme* - C. T. J. Dodson,
*Generalized hypergraphs* - P. Duchet,
*Kernel-perfect graph* - F. Esser,
*Zero eigenvalues of trees* - C. W. Evans,
*Automorphisms of trivalent nets* - M. Fontet,
*4-essential graphs* - F. Gavril (speaker) and R. Tamari,
*An algorithm for constructing a tree from edges* - H. Glover,
- D. Grant,
*Subgraphs and minimum valency* - C. D. Green,
*Tiling graphs and metacycles* - T. S. Griggs,
*Some results on cyclic Steiner quadruple systems* - A. Gyárfás,
- W. Haemers,
*Colouring strongly regular graphs* - F. Harary,
*Achievement games on graphs* - H. Harborth,
*Some bipartite Ramsey numbers* - B. Hartnell,
*The design of a resistance movement* - R. Hill (speaker) and R. W. Irving,
*Lower bounds on Ramsey numbers* - A. Hilton (speaker) and Lars Andersen,
*A sketch of a proof of the Evans conjecture for all n* - J. W. P. Hirschfeld,
*The characterization of projections of quadrics in PG(d,g), q even* - C. Hoede,
*Necessary and sufficient conditions for graphs, directed graphs and hypergraphs to be Hamiltonian* - S. G. Hoggar,
*Quaternionic polytopes* - D. A. Holton (speaker) and R. Eggleton,
*Degree sequences of multigraphs* - I. Holyer,
*The NP-completeness of some edge-partition problems* - Bill Jackson,
*Removable cycle in 2-connected simple graphs* - P. M. Jensen,
*The complexity of matroid algorithms* - D. Jungnickel,
*Generalized Hadamard matrices and symmetric nets* - G. Kalai,
*Analogues of Erdős-Ko-Rado and Sperner theorems* - A. A. Kaposi,
*The geometry of flowcharts* - A. D. Keedwell,
*When is a (k,w)-arc of PG(2,q) an algebraic plane curve?* - J. Lauri,
*On the reconstruction of planar graphs* - Lenz,
- D. Marusic,
*On Hamiltonian circuits in vertex symmetric graphs* - Miller,
- G. Moran,
*A function on ordered set as a sum of its increments* - M. Mulder,
*Hamming graphs and semimedian graphs* - C. St. J. A. Nash-Williams,
*Marriage in infinite societies: a progress report* - L. Nebeský,
*On projectoids* - A. Neumaier,
*Distances, graphs and designs* - S. Oates-Williams,
*Balanced binary arrays - a problem in experimental design* - E. M. Palmer,
*Counting fixed points in trees* - T. D. Parsons,
*Quasi-coverings and graph imbeddings* - D. H. Rees,
*Singleton-regular graphs* - G. Sabidussi,
- J. Schönheim,
*Decomposition of trees into isomorphic subtrees* - A. J. Schwenk (speaker) and R. J. Kimble,
*On dissimilar vertices and edges* - G. C. Shephard,
*Combinatorial problems related to fabrics* - J. M. S. Simoes-Pereira,
*Matroids on graphs* - Z. Skupien,
*On extending paths and path systems* - D. H. Smith,
*Counting Hamiltonian circuits* - M. M. Syslo,
*On cycle graphs of a graph* - H. M. V. Temperley,
*Young tableaux and the Potts model* - Andrew Thomason,
*An upper bound for bipartite Ramsey numbers* - B. Voigt,
*Partition properties of finite distributive lattices* - C. Vout,
*Interaction models with the deletion/contraction property* - M. Walker,
*Central root automorphisms of finite generalized polygons* - R. J. Wilson,
*Hunting snarks* - Joseph Zaks,
*Non-hamiltonian simple polytopal graphs having two types of faces* - D. Sotteau,
*The girth of directed graphs* - T. Zamfirescu,

Back to the British Combinatorial Conferences page.