Books in Discrete mathematics combinatorics

71-80 of 95 results in All results

Matroid Theory

1st Edition
January 1, 1985
A. Recski + 1 more
English
Hardback
9 7 8 - 0 - 4 4 4 - 8 7 5 8 0 - 8

Among the large number of international combinatorial colloquia organized in Hungary by the János Bolyai Mathematical Society, this was the first one devoted entirely to matroid theory. Tutorial series on regular matroids and matroid minors, oriented matroids, matroid oracles, engineering applications of matroids, and a large number of invited and contributed talks gave an up-to-date picture of this rapidly developing branch of discrete mathematics. Special attention was paid to the applications of matroids, which are becoming more and more important in many areas.

Graphs, Groups and Surfaces

2nd Edition
Volume 8
January 1, 1985
A.T. White
English
eBook
9 7 8 - 0 - 0 8 - 0 8 7 1 1 9 - 6

The field of topological graph theory has expanded greatly in the ten years since the first edition of this book appeared. The original nine chapters of this classic work have therefore been revised and updated. Six new chapters have been added, dealing with: voltage graphs, non-orientable imbeddings, block designs associated with graph imbeddings, hypergraph imbeddings, map automorphism groups and change ringing.Thirty-two new problems have been added to this new edition, so that there are now 181 in all; 22 of these have been designated as ``difficult'' and 9 as ``unsolved''. Three of the four unsolved problems from the first edition have been solved in the ten years between editions; they are now marked as ``difficult''.

Algorithms in Combinatorial Design Theory

1st Edition
Volume 26
January 1, 1985
C.J. Colbourn + 1 more
English
eBook
9 7 8 - 0 - 0 8 - 0 8 7 2 2 5 - 4

The scope of the volume includes all algorithmic and computational aspects of research on combinatorial designs. Algorithmic aspects include generation, isomorphism and analysis techniques - both heuristic methods used in practice, and the computational complexity of these operations. The scope within design theory includes all aspects of block designs, Latin squares and their variants, pairwise balanced designs and projective planes and related geometries.

Cycles in Graphs

1st Edition
Volume 27
January 1, 1985
B.R. Alspach + 1 more
English
eBook
9 7 8 - 0 - 0 8 - 0 8 7 2 2 6 - 1

This volume deals with a variety of problems involving cycles in graphs and circuits in digraphs. Leading researchers in this area present here 3 survey papers and 42 papers containing new results. There is also a collection of unsolved problems.

Random Graphs '83

1st Edition
Volume 28
January 1, 1985
A. Rucinski + 1 more
English
eBook
9 7 8 - 0 - 0 8 - 0 8 7 2 2 9 - 2

The range of random graph topics covered in this volume includes structure, colouring, algorithms, mappings, trees, network flows, and percolation. The papers also illustrate the application of probability methods to Ramsey's problems, the application of graph theory methods to probability, and relations between games on graphs and random graphs.

Topics on Perfect Graphs

1st Edition
Volume 21
November 1, 1984
V. Chvátal + 1 more
English
eBook
9 7 8 - 0 - 0 8 - 0 8 7 1 9 9 - 8

The purpose of this book is to present selected results on perfect graphs in a single volume. These take the form of reprinted classical papers, survey papers or new results.

Convexity and Graph Theory

1st Edition
Volume 20
January 1, 1984
M. Rosenfeld + 1 more
English
eBook
9 7 8 - 0 - 0 8 - 0 8 7 1 9 8 - 1

Among the participants discussing recent trends in their respective fields and in areas of common interest in these proceedings are such world-famous geometers as H.S.M. Coxeter, L. Danzer, D.G. Larman and J.M. Wills, and equally famous graph-theorists B. Bollobás, P. Erdös and F. Harary. In addition to new results in both geometry and graph theory, this work includes articles involving both of these two fields, for instance ``Convexity, Graph Theory and Non-Negative Matrices'', ``Weakly Saturated Graphs are Rigid'', and many more. The volume covers a broad spectrum of topics in graph theory, geometry, convexity, and combinatorics. The book closes with a number of abstracts and a collection of open problems raised during the conference.

Algebraic and Combinatorial Methods in Operations Research

1st Edition
Volume 19
January 1, 1984
R.E. Burkard + 2 more
English
eBook
9 7 8 - 0 - 0 8 - 0 8 7 2 0 6 - 3

For the first time, this book unites different algebraic approaches for discrete optimization and operations research. The presentation of some fundamental directions of this new fast developing area shows the wide range of its applicability.Specifically, the book contains contributions in the following fields: semigroup and semiring theory applied to combinatorial and integer programming, network flow theory in ordered algebraic structures, extremal optimization problems, decomposition principles for discrete structures, Boolean methods in graph theory and applications.