|
Combinatorial mathematics and its applications : proceedings of a conference held at the Mathematical Institute, Oxford, from 7-10 July, 1969 / edited by D. J. A. Welsh.
— London : Academic Press, 1971. x, 364 p. : il. ; 24 cm.
Incluye referencias bibliográficas e índices.
Contenido: M. Behzad, The total chromatic number of a graph: A survey — D. A. Bell, An introductory review of error correcting codes — N. Biggs, Intersection matrices for linear graphs — B. Bollobás, Graphs with given diameter and maximal valency and with a minimal number of edges — R. A. Brualdi, A general theorem concerning common transversals — R. O. Davies, Ramsey's theorem and a peculiar classification of subsets (Abstract) — M. A. H. Dempster, Two algorithms for the time-table problem — J. de Souza, Disjoint common transversals — G. A. Dirac, Menger's theorem and related topics (Abstract) — P. Erdös, Some unsolved problems in graph theory and combinatorial analysis — J. A. Formby, A computing procedure for bounding the chromatic number of a graph — H. O. Foulkes, Linear graphs and Schur-functions — R. K. Guy, Unsolved combinatorial problems — R. Halin, Studies on minimally $n$-connected graphs — A. J. W. Hilton, An intersection theorem for two families of finite sets — A. W. Ingleton, Representation of matroids — M. Lewin, Minimal coverings of matrices — F. Lunnon, The $IU$ function: The size of a free distributive lattice — J. McKay, Multidimensional partition — J. W. Moon, Four combinatorial problems — C. St. J. A. Nash-Williams, Possible directions in graph theory — T. A. J. Nicholson, A method for optimising permutation problems and its industrial applications — H. Perfect, Menger's graph theorem in relation to transversal theory (Abstract) — R. Penrose, Applications of negative dimensional tensors — J. S. Pym, A lattice of separating sets in a graph — R. Rado, A theorem on chains of finite sets. II (Abstract) — B. C. Rennie, Some problems of combinatorial geometry — N. Sauer, The largest number of edges of a graph such that not more than $g$ intersect in a point or more than $n$ are independent — C. A. B. Smith, Map colourings and linear mappings — W. Vollmerhaus, Graph theoretical methods in diffusion theory — D. J. A. Welsh, Combinatorial problems in matroid theory — H. S. Wilf, The friendship theorem — H. S. Wilf, An analogue of the chromatic polynomial for vertex assignments modulo 3 — R. J. Wilson, The Möbius function in combinatorial mathematics — D. R. Woodall, Thrackles and deadlock — D. R. Woodall, Square $\lambda$-linked designs: A survey.
ISBN 0127433503
|