University of Southampton, 11-15 July, 1983

- A. F. Alameddine,
*A number theoretic enumeration of a class of planar graphs* - Ian Anderson,
*Ladder graphs* - Patricia Ash,
*Two sufficient conditions for the existence of hamilton cycles in bipartite graphs* - R. A. Bailey,
*Quasi-complete Latin squares* - Lynn Margaret Batten,
*Maximal affine subplanes of finite projective planes* - Margaret Bayer,
*A conjecture concerning the f-vectors of polytopes* - Lowell W. Beineke,
*Some results on packings and valencies of bipartite graphs* - Dominique Benard,
*Expansion of centred triangulations* - Albrecht Beutelspacher,
*Baer subspaces of finite projective spaces* - Arie Bialostocki,
*Some Ramsey-type results regarding the graph of the n-cube* - Norman L. Biggs,
*Infinite symmetric cubic graphs* - A. Bouchet,
*Isotropic systems* - A. E. Brouwer,
*Near polygons and Fischer geometries* - Julia M. Mowlin Brown,
*On finite projective planes and their collineation groups* - D. V. Chopra,
*Some combinatorial investigations on arrays* - Arjeh M. Cohen,
*Finite groups generated by homologies in the projective octavian plane* - R. J. Cook (speaker) and D. G. Pryce,
*Uniformly geodetic graphs* - R. T. Curtis,
*The unital subcodes of the binary Golay code, G*_{24} - Elias Dahlhaus,
*NP-complete multiterminal cut problems* - D. E. Daykin,
*On direct products of expansive functions on weighted sets* - Italo J. Dejter,
*Equivalent conditions for Euler's problem on Z*^{4}-Hamiltonian cycles - Boris V. Dekster,
*Colouring Voronoi partitions of R*^{n}, S^{n} - C. T. J. Dodson,
*Hypergraph homology* - Hikoe Enomoto (speaker) and Akira Saito,
*Weakly 4-linked graphs* - J. Fabrega (speaker), M. Fiol and J. L. A. Yebra,
*Sequence graphs and interconnection networks* - Norman E. Fenton,
*A generalised theory of structured programming* - Herbert Fleischner,
*A way of enumerating Eulerian trails in a connected Eulerian graph* - Rodney W. Forcade,
*Hamiltonian paths in tournaments* - C. D. Gay,
*\beta-rings and enumeration* - John Gilder,
*Some parallelisms* - Reinaldo E. Giudici (speaker) and Roberto W. Frucht,
*Some chromatically unique graphs with seven points* - T. S. Griggs (speaker) and M. J . Grannell,
*S-cyclic Steiner systems* - Theo Grundhöfer,
*Groups of projectivities of finite planes* - Roland Häggkvist,
*Divide and conquer - asymptotic solutions of the Kelly and other Hamilton decomposition conjectures* - Heiko Harborth,
*Mosaic graphs* - B. L. Hartnell (speaker) and A. S. Finbow,
*A game related to covering by stars* - E. Harzheim,
*A remark on Dilworth's theorem* - A. J. W. Hilton (speaker) and A. G. Chetwynd,
*Regular graphs of high degree are 1-factorizable* - Cornelis Hoede,
*On measures for currents in networks* - S. G. Hoggar,
*Parameters of association schemes* - Rosemary Bailey, Peter Cameron, David Daykin, Tony Hilton, Fred
Holroyd and Chris Rowley,
*Introduction to intricacy* - T. Ito (speaker) and E. Bannai,
*The rationality of eigenvalues of (P and Q)-polynomial schemes* - Bill Jackson,
*Compatible cycles decompositions* - François Jaeger,
*On space-tiling zonotopes and regular chain-groups* - Lynne D. James,
*Imbeddings of complete graphs with large automorphism group* - J. L. Jolivet (speaker) and J. L. Fouquet,
*Strong chromatic index of cubic graphs* - Gareth A. Jones,
*Just-edge-transitive maps and Coxeter groups* - P. Katernis,
*Some results on the existence of 2n-factors in terms of vertex-deleted subgraphs* - A. D. Keedwell,
*Left neofields for which -1 has multiplicative order greater than two* - Arnfried Kemnitz,
*On a lattice point problem* - Ronald C. King,
*Supersymmetric functions and the Lie supergroup U(m/n)* - Peter Kirschenhofer,
*Some new results on the average height of binary trees* - M. Kouider (speaker), B. Peroche and D. Sotteau,
*The minimum number of paths necessary to partition or cover the edges of cartesian products of graphs* - Arnold R. Kräuter and Norbert Seifter,
*Some new results on permanents of (1,-1) matrices* - Jenö Lehel,
*Helly hypergraphs and abstract interval structures* - R. P. Lewis,
*A theorem about partitions of integers and its "bijective" proof* - Bernt Lindström,
*Natural classes of regular and non-regular matroids* - E. Keith Lloyd,
*J. Howard Redfield, polymath* - E. Keith Lloyd,
*Some little-known work of MacMahon on permanents* - Rosetta Lok,
*Almost-fixed points in neighbourhood spaces* - Judith Q. Longyear,
*A new construction for Hadamard matrices of orders 8t+4* - H. D. MacPherson,
*Enumeration of orbits of infinite permutation groups* - W. Mader,
*On minimally n-connected digraphs* - Dragan Marusic,
*Cayley properties of vertex symmetric graphs* - V. C. Mavron,
*Generalized quasiresidual designs* - F. R. McMorris (speaker) and Christopher A. Meacham,
*Partition intersection graphs* - J. W. Moon (speaker) and A. Meir,
*On subtrees of certain families of rooted trees* - H.-M. Nitzschke,
*Generalized bipartite Ramsey-numbers* - Peter Owens,
*Shortness parameters of some families of graphs* - János Pach,
*On disjointly representable sets* - Lindsay J. Paterson (speaker) and H. D. Patterson,
*An algorithm for constructing \alpha-lattice designs* - Tomaz Pisanski,
*Cartesian products and their crossing numbers* - Andrew D. Pollington,
*There is a long path in the divisor graph* - Helmut Prodinger,
*Some asymptotic results on the height of trees and lattice paths* - H. J. Prömel,
*Generalisations of a theorem of Erdős and Szekeres* - Marialuisa J. de Resmini,
*A characterization of the secants of an ovaloid in PG(3,q), q even, q > 2* - E. F. Robertson,
*Cayley graphs and presentations for finite simple groups* - Yehuda Roditty,
*On the linear arboricity of a graph* - Pablo M. Salzberg,
*A combinatorial approach to random number generation* - Jochanan Schönheim,
*On covering systems of congruences* - Norbert Seifter,
*Automorphisms of infinite graphs* - K. Seitz,
*Applications of group factorization methods in graph theory* - D. Singerman,
*Maps on surfaces with boundary* - Miroslawa Skowronska,
*On the Malkevitch conjecture for Halin graphs* - D. H. Smith,
*Reliable networks and (k,2k-2)-connected graphs* - R. G. Stanton,
*Appropriateness of standard BIBD presentation* - Maciej M. Syslo,
*Graph-theoretic approach to minimizing the jump number of posets* - H. N. V. Temperley,
*Towards a solution of the Potts model* - Andrew Thomason,
*Jumbled graphs* - A. Tietäväinen,
*Coding theory and character sums* - Zsolt Tuza,
*Ryser's conjecture on r-partite hypergraphs* - S. A. Vanstone (speaker) and A. Rosa,
*On the existence of strong Kirkman cubes of block size 3 and order 39* - Bernd Voigt,
*Canonizing partition theorems* - John J. Watkins,
*On the construction of snarks* - Ursula Webb,
*What does a random p-group look like?* - R. W. Whitty,
*Generation of an important class of program flowgraphs* - Marleen Willems,
*Laguerre extensions of Dembowski semi-planes* - Robin J. Wilson,
*Musical block designs* - J. L. A. Yebra (speaker), M. Fiol and J. Fabrega,
*The vertex-edge duality in the coloration of graphs and hypergraphs* - J. L. A. Yebra (speaker), M. Fiol and J. Fabrega,
*Semiregular bipartite Moore graphs* - C. Zaverdinos,
*On a covering problem of Ray-Chaudhuri*

Back to the British Combinatorial Conferences page.