Combinatorics de T. P. McDonough

Combinatorics: London Mathematical Society Lecture Note Series, cartea 13

T. P. McDonough

V. C. Mavron

en Limba Engleză Paperback – 20 noi 1974

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.

Citește tot Restrânge

Din seria London Mathematical Society Lecture Note Series

11%

Preț: 570^.40 lei
11%

Preț: 451^.68 lei
8%

Preț: 446^.84 lei
8%

Preț: 423^.02 lei
14%

Preț: 1158^.05 lei
8%

Preț: 448^.26 lei
Preț: 349^.77 lei
8%

Preț: 389^.36 lei
9%

Preț: 710^.04 lei
8%

Preț: 410^.19 lei
8%

Preț: 402^.16 lei
14%

Preț: 307^.93 lei
14%

Preț: 384^.07 lei
Preț: 295^.14 lei
8%

Preț: 411^.74 lei
8%

Preț: 521^.92 lei
11%

Preț: 586^.77 lei
8%

Preț: 410^.54 lei
11%

Preț: 655^.54 lei
11%

Preț: 448^.34 lei
8%

Preț: 531^.20 lei
8%

Preț: 496^.08 lei
11%

Preț: 659^.72 lei
11%

Preț: 552^.17 lei
14%

Preț: 675^.41 lei
11%

Preț: 472^.44 lei
Preț: 298^.40 lei
Preț: 430^.97 lei
11%

Preț: 468^.96 lei
Preț: 305^.49 lei
Preț: 302^.67 lei
Preț: 299^.88 lei
Preț: 304^.57 lei
Preț: 306^.18 lei
11%

Preț: 469^.29 lei
Preț: 421^.94 lei
Preț: 303^.26 lei
Preț: 300^.09 lei
11%

Preț: 422^.35 lei
Preț: 385^.23 lei
Preț: 430^.06 lei
11%

Preț: 403^.49 lei
Preț: 384^.87 lei
Preț: 337^.64 lei
11%

Preț: 403^.83 lei
Preț: 293^.14 lei
Preț: 382^.61 lei
11%

Preț: 443^.51 lei
11%

Preț: 467^.79 lei
11%

Preț: 554^.34 lei

Cuprins

Preface; 1. Perfect codes and distance-transitive graphs N. Biggs; 2. Generalisation of Fisher's inequality to fields with more than one element P. J. Cameron; 3. On balanced arrays D. V. Chopra; 4. Positions in Room squares R. L. Constable; 5. Analogues of Heawood's theorem R. J. Cook; 6. Cut-set lattices of graphs F. Escalante; 7. On the chromatic index of a graph, II. S. Fiorini and R. J. Wilson; 8. On a theorem of R. A. Liebler A. Gardiner; 9. Outerthickness and outercoarseness of graphs R. K. Guy; 10. Graphs with homeomorphically irreducible spanning trees A. Hill; 11. A note on embedding latin rectangles A. J. W. Hilton; 12. Some results in semi-stable graphs D. A. Holton; 13. Hereditary properties and P-chromatic numbers R. P. Jones; 14. Some problems concerning complete latin squares A. D. Keedwell; 15. Necklace enumeration with adjacency restrictions E. K. Lloyd; 16. On a family of planar bicritical graphs L. Lovasz and M. D. Plummer; 17. On the enumeration of partially ordered sets of integers J. C. P. Miller; 18. The distance between nodes in recursive trees J. W. Moon; 19. Partition relations R. Nelson; 20. On a problem of Daykin concerning inter secting families of sets J. Schonheim; 21. Unstable trees J. Sheehan; 22. Distance-transitive graphs D. H. Smith; 23. Enumeration of graphs on a large periodic lattice H. N. V. Temperley; 24. Some polynomials associated with graphs W. T. Tutte; 25. Equidistant point sets J. H. van Lint; 26. Figenvalues of graphs and operations D. A. Waller; 27. Graph theory and algebraic topology R. J. Wilson; 28. Applications of polymatroids and linear programming to transversals and graphs D. R. Woodall; Problem section.