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

14%

Preț: 1213^.29 lei
11%

Preț: 469^.02 lei
14%

Preț: 663^.21 lei
8%

Preț: 506^.14 lei
11%

Preț: 431^.49 lei
20%

Preț: 506^.46 lei
11%

Preț: 437^.60 lei
9%

Preț: 612^.96 lei
11%

Preț: 561^.39 lei
Preț: 403^.84 lei
11%

Preț: 561^.39 lei
Preț: 319^.34 lei
8%

Preț: 445^.57 lei
11%

Preț: 528^.93 lei
11%

Preț: 612^.98 lei
8%

Preț: 444^.27 lei
11%

Preț: 470^.65 lei
11%

Preț: 509^.80 lei
11%

Preț: 578^.77 lei
11%

Preț: 559^.74 lei
14%

Preț: 709^.91 lei
11%

Preț: 470^.65 lei
11%

Preț: 426^.31 lei
11%

Preț: 425^.60 lei
20%

Preț: 514^.12 lei
11%

Preț: 572^.21 lei
11%

Preț: 564^.59 lei
Preț: 402^.70 lei
11%

Preț: 566^.63 lei
11%

Preț: 476^.86 lei
Preț: 412^.40 lei
11%

Preț: 565^.05 lei
11%

Preț: 442^.53 lei
11%

Preț: 495^.03 lei
Preț: 313^.69 lei
11%

Preț: 401^.25 lei
11%

Preț: 491^.10 lei
Preț: 320^.70 lei
Preț: 317^.92 lei
Preț: 315^.15 lei
Preț: 319^.79 lei
Preț: 321^.39 lei
11%

Preț: 491^.43 lei
Preț: 441^.95 lei
Preț: 318^.49 lei
Preț: 315^.35 lei
11%

Preț: 439^.64 lei
Preț: 405^.64 lei
11%

Preț: 400^.45 lei
11%

Preț: 420^.98 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.