Author: E. Keith Lloyd
Publisher: Cambridge University Press
Published: 1983-08-11
Total Pages: 271
ISBN-13: 0521275520
DOWNLOAD EBOOK →This volume contains the invited papers from the 1983 British Combinatorial Conference. Several distinguished mathematicians were invited to give a lecture and write a paper for the conference volume. The papers cover a broad range of combinatorial topics, including enumeration, finite geometries, graph theory and permanents.
Author: C. Whitehead
Publisher: CUP Archive
Published: 1987-07-16
Total Pages: 264
ISBN-13: 9780521348058
DOWNLOAD EBOOK →Author: Peter Rowlinson
Publisher: Cambridge University Press
Published: 1995-07-20
Total Pages: 240
ISBN-13: 9780521497978
DOWNLOAD EBOOK →This volume provides an up-to-date survey of current research activity in several areas of combinatorics and its applications. These include distance-regular graphs, combinatorial designs, coding theory, spectra of graphs, and randomness and computation. The articles give an overview of combinatorics that will be extremely useful to both mathematicians and computer scientists.
Author: J. Siemons
Publisher: Cambridge University Press
Published: 1989-08-03
Total Pages: 232
ISBN-13: 9780521378239
DOWNLOAD EBOOK →Many areas of current research activity in combinatorics and its applications, including graph theory, designs and probabilistic graphs, are surveyed in lectures presented at the 12th British Combinatorial Conference.
Author: Ian Anderson
Publisher: Cambridge University Press
Published: 1985-07-25
Total Pages: 181
ISBN-13: 0521315247
DOWNLOAD EBOOK →This volume contains the invited papers at the 1985 British Combinatorial Conference presented by several distinguished mathematicians.
Author: Ian Anderson
Publisher: Cambridge University Press
Published: 1985-07-25
Total Pages: 180
ISBN-13: 9780521315241
DOWNLOAD EBOOK →The British Combinatorial Conference is an established biennial international gathering. This volume contains the invited papers presented, by several distinguished mathematicians, at the 1985 conference. The papers cover a broad range of combinatorial topics, including cryptography, greedy algorithms, graph minors, flows through random networks, (0, 1)-distance problems, irregularities of point distributions and reconstruction of infinite graphs.