info@woodslane.com.au
Contact us on (02) 8445 2300
For all customer service and order enquiries

WOODSLANE

Popular Subjects

Woodslane Online Catalogues

9780801869778 Add to Cart Academic Inspection Copy

Combinatorics and Partially Ordered Sets:

Dimension Theory
  • ISBN-13: 9780801869778
  • Publisher: JOHNS HOPKINS UNIVERSITY PRESS
    Imprint: JOHNS HOPKINS UNIVERSITY PRESS
  • By William T. Trotter
  • Price: AUD $90.99
  • Stock: 0 in stock
  • Availability: This book is temporarily out of stock, order will be despatched as soon as fresh stock is received.
  • Local release date: 16/03/2002
  • Format: Paperback 328 pages Weight: 0g
  • Categories: Mathematics [PB]
Description
Table of
Contents
Reviews
Google
Preview
Primarily intended for research mathematicians and computer scientists, Combinatorics and Partially Ordered Sets: Dimension Theory also serves as a useful text for advanced students in either field. William Trotter concentrates on combinatorial topics for finite partially ordered sets, and with dimension theory serving as a unifying theme, research on partially ordered sets or posets is linked to more traditional topics in combinatorial mathematics–including graph theory, Ramsey theory, probabilistic methods, hypergraphs, algorithms, and computational geometry. The book's most important contribution is to collect, organize, and explain the many theorems on partially ordered sets in a way that makes them available to the widest possible audience. Chapters: Introduction to Dimension † Crowns, Splits, Stacks, Sums and Products † Characterization Problems for Posets, Lattices, Graphs, and Families of Sets † Hypergraph Coloring, Computational Complexity, and Irreducible Posets † Planar Posets and Trees † Planar Graphs, Planar Maps and Convex Polytopes † Probabilistic Methods in Dimension Theory † Interval and Geometric Containment Orders † Greedy Dimension, Back-Tracking, and Depth First Search † Products of Chains of Bounded Length † Large Minimal Realizers

Contents:
Introduction to Dimension

  • Crowns, Splits, Stacks, Sums and Products
  • Characterization Problems for Posets, Lattices, Graphs, and Families of Sets
  • Hypergraph Coloring, Computational Complexity and Irreducible Posets
  • Planar Maps, and Convex Polytopes
  • Probabilistic Methods in Dimension Theory
  • Interval and Geometric Containment Orders
  • Greedy Dimension, Back-Tracking and Depth First Search
  • Products of Chains of Bounded Length
  • Large Minimal Realizers

    • ""Eminently suitable as a self-study or supervised text in partially ordered sets and combinatorics.""

    Google Preview content