Graph Theory and Combinatorics 1988

Graph Theory and Combinatorics 1988
Author: B. Bollobás
Publisher: Elsevier
Total Pages: 419
Release: 1989-07-01
Genre: Mathematics
ISBN: 0080867839

Download Graph Theory and Combinatorics 1988 Book in PDF, Epub and Kindle

Combinatorics has not been an established branch of mathematics for very long: the last quarter of a century has seen an explosive growth in the subject. This growth has been largely due to the doyen of combinatorialists, Paul Erdős, whose penetrating insight and insatiable curiosity has provided a huge stimulus for workers in the field. There is hardly any branch of combinatorics that has not been greatly enriched by his ideas. This volume is dedicated to Paul Erdős on the occasion of his seventy-fifth birthday.

Applications of Combinatorics and Graph Theory to the Biological and Social Sciences

Applications of Combinatorics and Graph Theory to the Biological and Social Sciences
Author: Fred Roberts
Publisher: Springer Science & Business Media
Total Pages: 345
Release: 2012-12-06
Genre: Mathematics
ISBN: 1468463810

Download Applications of Combinatorics and Graph Theory to the Biological and Social Sciences Book in PDF, Epub and Kindle

This IMA Volume in Mathematics and its Applications Applications of Combinatorics and Graph Theory to the Biological and Social Sciences is based on the proceedings of a workshop which was an integral part of the 1987-88 IMA program on APPLIED COMBINATORICS. We are grateful to the Scientific Committee: Victor Klee (Chairman), Daniel Kleitman, Dijen Ray-Chaudhuri and Dennis Stanton for planning and implementing an exciting and stimulating year long program. We especially thank the Workshop Organizers, Joel Cohen and Fred Roberts, for organizing a workshop which brought together many of the major figures in a variety of research fields connected with the application of combinatorial ideas to the social and biological sciences. A vner Friedman Willard Miller APPLICATIONS OF COMBINATORICS AND GRAPH THEORY TO THE BIOLOGICAL AND SOCIAL SCIENCES: SEVEN FUNDAMENTAL IDEAS FRED S. RoBERTS* Abstract. To set the stage for the other papers in this volume, seven fundamental concepts which arise in the applications of combinatorics and graph theory in the biological and social sciences are described. These ideas are: RNA chains as "words" in a 4 letter alphabet; interval graphs; competition graphs or niche overlap graphs; qualitative stability; balanced signed graphs; social welfare functions; and semiorders. For each idea, some basic results are presented, some recent results are given, and some open problems are mentioned.

Congressus Numerantium

Congressus Numerantium
Author:
Publisher:
Total Pages: 318
Release: 1988
Genre:
ISBN:

Download Congressus Numerantium Book in PDF, Epub and Kindle

Computational Discrete Mathematics

Computational Discrete Mathematics
Author: Sriram Pemmaraju
Publisher: Cambridge University Press
Total Pages: 615
Release: 2009-10-15
Genre: Computers
ISBN: 1107268710

Download Computational Discrete Mathematics Book in PDF, Epub and Kindle

This book was first published in 2003. Combinatorica, an extension to the popular computer algebra system Mathematica®, is the most comprehensive software available for teaching and research applications of discrete mathematics, particularly combinatorics and graph theory. This book is the definitive reference/user's guide to Combinatorica, with examples of all 450 Combinatorica functions in action, along with the associated mathematical and algorithmic theory. The authors cover classical and advanced topics on the most important combinatorial objects: permutations, subsets, partitions, and Young tableaux, as well as all important areas of graph theory: graph construction operations, invariants, embeddings, and algorithmic graph theory. In addition to being a research tool, Combinatorica makes discrete mathematics accessible in new and exciting ways to a wide variety of people, by encouraging computational experimentation and visualization. The book contains no formal proofs, but enough discussion to understand and appreciate all the algorithms and theorems it contains.