6th British Combinatorial Conference
Royal Holloway College, London, 11-15 July 1977

Contributed talks:

• I. Anderson, Bi-embeddings
• Annie Astie-Vidal, Base graphs of matroids
• Peter Avery, Some links between finite topologies and transitive digraphs
• László Babai, Spectra, automorphism groups and isomorphism of graphs
• R. A. Bailey, Automorphism groups of latin squares
• Imre Bárány, A short proof of Kneser's conjecture
• Z. Baranyai, Equalized matrices
• L. W. Beineke (speaker) and R. D. Ringeisen, On crossing numbers of products of graphs and some unrelated results
• Henry Beker (speaker) and Willem Haemers, Designs with the intersection number k-r+\lambda
• Lucien Beneteau, Combinatorial properties of Hall triple systems
• Jean-Claude Bermond, Hamiltonian decompositions of hypergraphs
• Robert G. Bland, The simplex method of linear programming over oriented matroids
• Gary S. Bloom (speaker), Gray Haggard and Herbert Taylor, The continuing quest to call all trees graceful
• A. E. Brouwer, Some new t-designs
• A. R. Camina, 1½-transitive groups and designs
• Paul Camion, Quadratic abelian codes and Miquelian inversive planes
• Colin M. Campbell (speaker) and Edmund F. Robertson, Fibonacci-type groups
• A. Cazes (speaker), O. Cogis and M. Habib, On a notion of digraph dimension that generalizes order dimension
• L. J. Cummings, Products of comma-free codes
• Nasser Dastrange, On the Hamming distance and error correcting codes
• J. E. Dawson, Balanced sets in a transversal structure
• D. E. Daykin, The intersection of the shadows of two finite families of sets
• Ingrid Debroey (speaker) and J. A. Thas, Semi partial geometries in PG(2,s), PG(3,s), AG(2,s+1) and AG(3,s+1)
• Frank de Clerck, Partial geometries with \alpha = s - 1
• Anne de Frenne, The timetabling problem: a survey
• R. H. F. Denniston, No S(4,5,17) could have automorphisms
• M. Deza (speaker) and S. A. Vanstone, Bounds for permutation arrays
• Willibald Dörfler, Double covers of hypergraphs and their properties
• P. Ducrocq (speaker) and F. Sterboul, On G-triple systems
• C. S. Edwards, More about the largest number of triangles with a common edge in a graph
• Trevor Evans, Free algebra and combinatorial designs
• M. Farzan, Covering projections of graphs
• S. Fiorini, Forbidden subgraphs and Ulam's conjecture
• András Frank, Kernel systems of directed graphs
• Peter Futo, Cluster analysis based on hypergraph theory
• J. M. Goethals (speaker), P. J. Cameron and J. J. Seidel, Strongly regular graphs with strongly regular sub-constituents
• Martin Charles Golumbic, Chordal bipartite graphs and perfect Gaussian elimination
• Paul Goodey, Hamiltonian circuits in polytopes
• Curtis Greene, Young tableaux and partially ordered sets
• A. Gyárfás, Covering the edges of a hypergraph with vertex-partitions
• Willems Haemers, A symmetric 2-(71,15,3) designs
• Roland Häggkvist, Some conditions for the existence of long cycles in a graph
• Heiko Harborth, Venn diagrams for multiples of four numbers
• R. Hill, Applications of coding theory to packing problems in finite geometries
• A. J. W. Hilton, Some theorems on finite sets
• J. W. P. Hirschfeld (speaker) and J. A. Thas, Sets of class (l,n,q+1) in PG(3,q)
• C. Hoede (speaker) and A. M. Cohen, Some results on hamiltonian graphs
• S. G. Hoggar, Difference sets and equiangular lines
• F. C. Holroyd (speaker) and P. E. D. Strain, Group theory and edge-colourings
• Joan P. Hutchinson (speaker) and Michael O. Albertson, On six-chromatic toroidal graphs
• W. Imrich, Subgroup theorems and graphs
• Antai Iványi, Enumeration problems in the computer performance analysis
• F. Jaeger, Trees and nowhere-zero flows in cubic graphs
• Dieter Jungnickel, Klingenberg structures and Hjelmslev planes
• A. A. Kaposi and C. H. Dowker, Flowcharts and graphs
• Péter Kas, How to choose subsets to get uniform degrees of points
• A. D. Keedwell, On circuit decompositions of graphs, P-quasigroups and room designs
• Michel Las Vergnas, Acyclic and totally cyclic orientations of graphs and combinatorial geometries
• Hanfried Lenz, Numerical estimates for block designs and related incidence structures
• Roy B. Levow, On uniquely four-colorable planar graphs
• E. K. Lloyd, Generating paths in digraphs
• M. Lorea, On Turan hypergraphs
• W. Mader, On the maximum number of disjoint A-paths
• Günther Malle, Edge orientations on cubic graphs
• Bennet Manvel (speaker) and Bela Bollobas, Optimal partitioning of vertices
• L. R. Matthews, Matroids from directed graphs
• V. C. Mavron, Bruck's theorem and Baer subdesigns
• Rudolf Metz, A class of small Steiner systems
• V. D. Milman (speaker) and M. G. Karpovsky, Some extremal Ramsey-type problems for finite homogeneous spaces
• C. W. Mitchell, Plane hexagons
• John Mitchem, On the genus of graphs with Lick-White number K
• J. W. Moon (speaker) and A. Meir, On the altitude of nodes in random trees
• Martyn Mulder, Median graphs and Helly hypergraphs
• M. Ram Murty (speaker) and V. Kumar Murty, On the density of various classes of groups
• C. St. J. A. Nash-Williams, A new criterion for marriage in denumerable societies
• Arnold Neumaier, Tuple systems, t-designs, latin squares and graph designs
• P. J. Owens, On regular graphs and hamiltonian circuits
• James G. Oxley, Colouring and the critical problem
• Edgar M. Palmer, On the number of colorings of polyhedra which are self-complementary, self-dual or achiral
• T. D. Parsons (speaker) and Brian Alspach, Circulant graphs
• B. Péroche, On cyclic connectivity
• Vera Pless (speaker) and J. H. Conway, An enumeration of self-dual codes
• D. A. Preece (speaker), R. A. Bailey and P. J. Zemroch, Fully symmetric latin squares
• Oliver Pretzel, Dedekind cuts on partially ordered sets
• Richard Rado (speaker) and A. J. Wilkie, Reconstruction theorems for families of sets
• András Recski, On the solvability of the matroid equation A v X = C
• Edmund F. Robertson, The groups < R,S | R² = RS^aRS^bRS^c = 1>
• Joachim Röhmel, Designs from Frobenius groups
• A. Rosa (speaker), C. Huang and E. Mendelsohn, On a class of partially resolvable t-partitions
• J. Schönheim, Again on the conjecture of Chvatal
• S. Schrijver, An elementary proof of Minc's conjecture
• Beniamino Segre (speaker) and Gabriel Korchmáros, New results on Galois geometries
• Louis W. Shapiro, The numbers of Schröder and Catalan
• Mohan S. Shrikhande (speaker) and R. C. Bose, On a class of partially balanced designs
• David Singmaster, An elementary evaluation of the Catalan numbers
• Z. Skupien, On homogeneously traceable graphs
• D. H. Smith, Completely regular codes in distance-regular graphs
• Dominique Sotteau (speaker), J. C. Bermond and A. Germa, Resolvable decompositions
• F. Sterboul, A characterization of the graphs in which the transversal number equals the matching number
• H. N. V. Temperley (speaker), R. J. Baxter and S. E. Ashley, New results on the Potts model
• J. A. Thas, Partial geometries in finite affine spaces
• G. P. Thomas, More about Baxter sequences
• Aimo Tietäväinen, Nonexistence of nontrivial perfect codes for the case q = p₁^rp₂^s, e >= 3.
• Béla Uhrin, On the number of lattice points in A+B, where A,B \subset Rⁿ
• Stanley Wagon, An extension of Lovász's perfect graph theorem to infinite graphs
• Derek Waller, Combinatorics of the musical chords
• Richard Weiss, Locally transitive graphs
• B. J. Wilson, Regular (k,n)-caps
• A. Pawel Wojda, Graphs of vicinal preorder

Back to the British Combinatorial Conferences page.