Seems you have not registered as a member of brazil123.net!

You may have to register before you can download all our books and magazines, click the sign up button below to create a free account.

Sign up

Discrete Mathematics
  • Language: en
  • Pages: 284

Discrete Mathematics

Aimed at undergraduate mathematics and computer science students, this book is an excellent introduction to a lot of problems of discrete mathematics. It discusses a number of selected results and methods, mostly from areas of combinatorics and graph theory, and it uses proofs and problem solving to help students understand the solutions to problems. Numerous examples, figures, and exercises are spread throughout the book.

Combinatorial Problems and Exercises
  • Language: en
  • Pages: 636

Combinatorial Problems and Exercises

  • Type: Book
  • -
  • Published: 2014-06-28
  • -
  • Publisher: Elsevier

The aim of this book is to introduce a range of combinatorial methods for those who want to apply these methods in the solution of practical and theoretical problems. Various tricks and techniques are taught by means of exercises. Hints are given in a separate section and a third section contains all solutions in detail. A dictionary section gives definitions of the combinatorial notions occurring in the book. Combinatorial Problems and Exercises was first published in 1979. This revised edition has the same basic structure but has been brought up to date with a series of exercises on random walks on graphs and their relations to eigenvalues, expansion properties and electrical resistance. In various chapters the author found lines of thought that have been extended in a natural and significant way in recent years. About 60 new exercises (more counting sub-problems) have been added and several solutions have been simplified.

Large Networks and Graph Limits
  • Language: en
  • Pages: 475

Large Networks and Graph Limits

Recently, it became apparent that a large number of the most interesting structures and phenomena of the world can be described by networks. To develop a mathematical theory of very large networks is an important challenge. This book describes one recent approach to this theory, the limit theory of graphs which has emerged over the last decade.

An Algorithmic Theory of Numbers, Graphs and Convexity
  • Language: en
  • Pages: 91

An Algorithmic Theory of Numbers, Graphs and Convexity

  • Type: Book
  • -
  • Published: 1987-01-01
  • -
  • Publisher: SIAM

Studies two algorithms in detail: the ellipsoid method and the simultaneous diophantine approximation method.

Matching Theory
  • Language: en
  • Pages: 547

Matching Theory

This book surveys matching theory, with an emphasis on connections with other areas of mathematics and on the role matching theory has played, and continues to play, in the development of some of these areas. Besides basic results on the existence of matchings and on the matching structure of graphs, the impact of matching theory is discussed by providing crucial special cases and nontrivial examples on matroid theory, algorithms, and polyhedral combinatorics. The new Appendix outlines how the theory and applications of matching theory have continued to develop since the book was first published in 1986, by launching (among other things) the Markov Chain Monte Carlo method.

Geometric Algorithms and Combinatorial Optimization
  • Language: en
  • Pages: 362

Geometric Algorithms and Combinatorial Optimization

Historically, there is a close connection between geometry and optImization. This is illustrated by methods like the gradient method and the simplex method, which are associated with clear geometric pictures. In combinatorial optimization, however, many of the strongest and most frequently used algorithms are based on the discrete structure of the problems: the greedy algorithm, shortest path and alternating path methods, branch-and-bound, etc. In the last several years geometric methods, in particular polyhedral combinatorics, have played a more and more profound role in combinatorial optimization as well. Our book discusses two recent geometric algorithms that have turned out to have parti...

Algebraic methods in graph theory
  • Language: en
  • Pages: 847

Algebraic methods in graph theory

Good,No Highlights,No Markup,all pages are intact, Slight Shelfwear,may have the corners slightly dented, may have slight color changes/slightly damaged spine.

Combinatorics
  • Language: hu
  • Pages: 596

Combinatorics

Leading combinatorialists from around the world contributed to this volume. The plenary lecturers were the following: J. Beck (on combinatorial games), B. Bollobaacute;s (on cycles in random graphs), A. Brouwer (on extremal design theory), P. Erdodblac;s (on problems and results in combinatorics), C. Godsil (on the application of linear algebra in combinatorics), L. Lovaacute;sz (on matching theory), A.A. Razborov (on Boolean complexity), M. Saks (on collective coin flipping), and A. Schrijver (on disjoint paths in graphs).

Greedoids
  • Language: en
  • Pages: 214

Greedoids

None

Matroid theory
  • Language: en
  • Pages: 438

Matroid theory

  • Type: Book
  • -
  • Published: 1986
  • -
  • Publisher: Unknown

None