Title:
Combinatorics : proceedings
Series:
Lecture notes series (London Mathematical Society) ; 13
Publication Information:
Cambridge : University Press, 1974
ISBN:
9780521204545
Subject Term:
Available:*
Library | Item Barcode | Call Number | Material Type | Item Category 1 | Status |
|---|---|---|---|---|---|
Searching... | 30000001635477 | QA165 B75 1973 | Open Access Book | Proceedings, Conference, Workshop etc. | Searching... |
On Order
Summary
Summary
This volume is a record of the papers presented to the fourth British Combinatorial Conference held in Aberystwyth in July 1973. Contributors from all over the world took part and the result is a very useful and up-to-date account of what is happening in the field of combinatorics. A section of problems illustrates some of the topics in need of further investigation.
Table of Contents
| Preface |
| 1 Perfect codes and distance-transitive graphs N. Biggs |
| 2 Generalisation of Fisher's inequality to fields with more than one elementP. J. Cameron |
| 3 On balanced arraysD. V. Chopra |
| 4 Positions in Room squaresR. L. Constable |
| 5 Analogues of Heawood's theoremR. J. Cook |
| 6 Cut-set lattices of graphsF. Escalante |
| 7 On the chromatic index of a graphII. S. Fiorini and R. J. Wilson |
| 8 On a theorem of R. A. LieblerA. Gardiner |
| 9 Outerthickness and outercoarseness of graphsR. K. Guy |
| 10 Graphs with homeomorphically irreducible spanning treesA. Hill |
| 11 A note on embedding latin rectanglesA. J. W. Hilton |
| 12 Some results in semi-stable graphsD. A. Holton |
| 13 Hereditary properties and P-chromatic numbersR. P. Jones |
| 14 Some problems concerning complete latin squaresA. D. Keedwell |
| 15 Necklace enumeration with adjacency restrictionsE. K. Lloyd |
| 16 On a family of planar bicritical graphsL. Lovasz and M. D. Plummer |
| 17 On the enumeration of partially ordered sets of integersJ. C. P. Miller |
| 18 The distance between nodes in recursive treesJ. W. Moon |
| 19 Partition relationsR. Nelson |
| 20 On a problem of Daykin concerning inter secting families of setsJ. Schonheim |
| 21 Unstable treesJ. Sheehan |
| 22 Distance-transitive graphsD. H. Smith |
| 23 Enumeration of graphs on a large periodic latticeH. N. V. Temperley |
| 24 Some polynomials associated with graphsW. T. Tutte |
| 25 Equidistant point setsJ. H. van Lint |
| 26 Figenvalues of graphs and operationsD. A. Waller |
| 27 Graph theory and algebraic topologyR. J. Wilson |
| 28 Applications of polymatroids and linear programming to transversals and graphsD. R. Woodall |
| Problem section |
