Handbook of combinatorics
Material type:
TextPublication details: Netherlands North-Holland 1995Description: 1120p., 250mm, Indexes, hardbackISBN: - 0444823468
| Item type | Current library | Call number | Copy number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
| Standard Loan | Thurles Library Main Collection | 511.6 GRA (Browse shelf(Opens below)) | 1 | Available | R03166PKRCT |
Enhanced descriptions from Syndetics:
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.
Covering important results and current trends and issues across the spectrum of combinatorics, this volume covers finite sets and relations, matroids, symmetric structures, and combinatorial structures in geometry and number theory.
BASIC GRAPH THEORY PATHS AND CIRCUITS
Table of contents provided by Syndetics
- Part II Aspects
- Algebraic enumeration
- Asymptotic enumeration methods
- Extremal graph theory
- Extremal set systems
- Ramsey Theory
- Discrepancy theory
- Automorphism groups, isomorphism, reconstruction
- Optimization
- Computational complexity
- Part III Methods
- Polyhedral combinatorics
- Tools from linear algebra
- Tools from higher algebra
- Probabilistic methods
- Topological pethods
- Part IV Applications
- Combinatorics in operations research
- Combinatorics in electrical engineering and statics
- Combinatorics in statistical mechanics
- Combinatorics in chemistry
- Applications of combinatorics to molecular biology
- Combinatorics in computer science
- Combinatorics in pure mathematics
- Part V Horizons
- Infinite combinatorics
- Combinatorial games
- The history of combinatorics
- Author Index
- Subject Index