Welcome to our book review site go-pdf.online!

You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.

Sign up

Combinatorics 79. Part II
  • Language: en
  • Pages: 319

Combinatorics 79. Part II

  • Type: Book
  • -
  • Published: 2011-08-26
  • -
  • Publisher: Elsevier

Combinatorics 79. Part II

Combinatorial Mathematics
  • Language: en
  • Pages: 683

Combinatorial Mathematics

  • Type: Book
  • -
  • Published: 2012-01-25
  • -
  • Publisher: Elsevier

The object of this book is to provide an account of the results and methods used in combinatorial theories: Graph Theory, Matching Theory, Hamiltonian Problems, Hypergraph Theory, Designs, Steiner Systems, Latin Squares, Coding Matroids, Complexity Theory.In publishing this volume, the editors do not intend to discuss all the classical open problems in combinatorics for which an algebraic approach turns out to be useful. The work is a selection which is intended for specialists, as well as for graduate students who may also be interested in survey papers. The work features a special section which contains a list of unsolved problems proposed by the participants.

Hypergraphs
  • Language: en
  • Pages: 267

Hypergraphs

  • Type: Book
  • -
  • Published: 1984-05-01
  • -
  • Publisher: Elsevier

Graph Theory has proved to be an extremely useful tool for solving combinatorial problems in such diverse areas as Geometry, Algebra, Number Theory, Topology, Operations Research and Optimization. It is natural to attempt to generalise the concept of a graph, in order to attack additional combinatorial problems. The idea of looking at a family of sets from this standpoint took shape around 1960. In regarding each set as a ``generalised edge'' and in calling the family itself a ``hypergraph'', the initial idea was to try to extend certain classical results of Graph Theory such as the theorems of Turán and König. It was noticed that this generalisation often led to simplification; moreover, one single statement, sometimes remarkably simple, could unify several theorems on graphs. This book presents what seems to be the most significant work on hypergraphs.

Graph Coloring Problems
  • Language: en
  • Pages: 320

Graph Coloring Problems

Contains a wealth of information previously scattered in research journals, conference proceedings and technical reports. Identifies more than 200 unsolved problems. Every problem is stated in a self-contained, extremely accessible format, followed by comments on its history, related results and literature. The book will stimulate research and help avoid efforts on solving already settled problems. Each chapter concludes with a comprehensive list of references which will lead readers to original sources, important contributions and other surveys.

Handbook of Combinatorics Volume 1
  • Language: en
  • Pages: 1124

Handbook of Combinatorics Volume 1

  • Type: Book
  • -
  • Published: 1995-12-11
  • -
  • Publisher: Elsevier

Handbook of Combinatorics, Volume 1 focuses on basic methods, paradigms, results, issues, and trends across the broad spectrum of combinatorics. The selection first elaborates on the basic graph theory, connectivity and network flows, and matchings and extensions. Discussions focus on stable sets and claw free graphs, nonbipartite matching, multicommodity flows and disjoint paths, minimum cost circulations and flows, special proof techniques for paths and circuits, and Hamilton paths and circuits in digraphs. The manuscript then examines coloring, stable sets, and perfect graphs and embeddings and minors. The book takes a look at random graphs, hypergraphs, partially ordered sets, and matroids. Topics include geometric lattices, structural properties, linear extensions and correlation, dimension and posets of bounded degree, hypergraphs and set systems, stability, transversals, and matchings, and phase transition. The manuscript also reviews the combinatorial number theory, point lattices, convex polytopes and related complexes, and extremal problems in combinatorial geometry. The selection is a valuable reference for researchers interested in combinatorics.

The Mathematics of Paul Erdös II
  • Language: en
  • Pages: 591

The Mathematics of Paul Erdös II

In 1992, when Paul Erdos was awarded a Doctor Honoris Causa by Charles University in Prague, a small conference was held, bringing together a distin guished group of researchers with interests spanning a variety of fields related to Erdos' own work. At that gathering, the idea occurred to several of us that it might be quite appropriate at this point in Erdos' career to solicit a col lection of articles illustrating various aspects of Erdos' mathematical life and work. The response to our solicitation was immediate and overwhelming, and these volumes are the result. Regarding the organization, we found it convenient to arrange the papers into six chapters, each mirroring Erdos' holistic appr...

Handbook of Combinatorics
  • Language: en
  • Pages: 2404

Handbook of Combinatorics

  • Type: Book
  • -
  • Published: 1995-12-11
  • -
  • Publisher: Elsevier

Handbook of Combinatorics

Handbook of Combinatorics Volume 1
  • Language: en
  • Pages: 1121

Handbook of Combinatorics Volume 1

  • Type: Book
  • -
  • Published: 1995-12-11
  • -
  • Publisher: Elsevier

Handbook of Combinatorics, Volume 1 focuses on basic methods, paradigms, results, issues, and trends across the broad spectrum of combinatorics. The selection first elaborates on the basic graph theory, connectivity and network flows, and matchings and extensions. Discussions focus on stable sets and claw free graphs, nonbipartite matching, multicommodity flows and disjoint paths, minimum cost circulations and flows, special proof techniques for paths and circuits, and Hamilton paths and circuits in digraphs. The manuscript then examines coloring, stable sets, and perfect graphs and embeddings and minors. The book takes a look at random graphs, hypergraphs, partially ordered sets, and matroids. Topics include geometric lattices, structural properties, linear extensions and correlation, dimension and posets of bounded degree, hypergraphs and set systems, stability, transversals, and matchings, and phase transition. The manuscript also reviews the combinatorial number theory, point lattices, convex polytopes and related complexes, and extremal problems in combinatorial geometry. The selection is a valuable reference for researchers interested in combinatorics.

Finite Packing and Covering
  • Language: en
  • Pages: 406

Finite Packing and Covering

This book provides an in-depth discussion of the theory of finite packings and coverings by convex bodies.

Combinatorial Optimization
  • Language: en
  • Pages: 2024

Combinatorial Optimization

From the reviews: "About 30 years ago, when I was a student, the first book on combinatorial optimization came out referred to as "the Lawler" simply. I think that now, with this volume Springer has landed a coup: "The Schrijver". The box is offered for less than 90.- EURO, which to my opinion is one of the best deals after the introduction of this currency." OR-Spectrum