Author: Frederick Hoffman
Publisher:
ISBN:
Category : Combinatorial analysis
Languages : en
Pages : 564

Get Book

Book Description

Author: Ivan Rival
Publisher: Springer Science & Business Media
ISBN: 9400953151
Category : Mathematics
Languages : en
Pages : 798

Get Book

Book Description
This volume contains the accounts of the principal survey papers presented at GRAPHS and ORDER, held at Banff, Canada from May 18 to May 31, 1984. This conference was supported by grants from the N.A.T.O. Advanced Study Institute programme, the Natural Sciences and Engineering Research Council of Canada and the University of Calgary. We are grateful for all of this considerable support. Almost fifty years ago the first Symposium on Lattice Theory was held in Charlottesville, U.S.A. On that occasion the principal lectures were delivered by G. Birkhoff, O. Ore and M.H. Stone. In those days the theory of ordered sets was thought to be a vigorous relative of group theory. Some twenty-five years ago the Symposium on Partially Ordered Sets and Lattice Theory was held in Monterey, U.S.A. Among the principal speakers at that meeting were R.P. Dilworth, B. Jonsson, A. Tarski and G. Birkhoff. Lattice theory had turned inward: it was concerned primarily with problems about lattices themselves. As a matter of fact the problems that were then posed have, by now, in many instances, been completely solved.

Author: Rudolf Fritsch
Publisher: Springer Science & Business Media
ISBN: 9780387984971
Category : Mathematics
Languages : en
Pages : 294

Get Book

Book Description
This elegant little book discusses a famous problem that helped to define the field now known as graph theory: what is the minimum number of colors required to print a map such that no two adjoining countries have the same color, no matter how convoluted their boundaries are. Many famous mathematicians have worked on the problem, but the proof eluded formulation until the 1970s, when it was finally cracked with a brute-force approach using a computer. The Four-Color Theorem begins by discussing the history of the problem up to the new approach given in the 1990s (by Neil Robertson, Daniel Sanders, Paul Seymour, and Robin Thomas). The book then goes into the mathematics, with a detailed discussion of how to convert the originally topological problem into a combinatorial one that is both elementary enough that anyone with a basic knowledge of geometry can follow it and also rigorous enough that a mathematician can read it with satisfaction. The authors discuss the mathematics and point to the philosophical debate that ensued when the proof was announced: just what is a mathematical proof, if it takes a computer to provide one - and is such a thing a proof at all?

Author:
Publisher:
ISBN:
Category :
Languages : en
Pages : 192

Get Book

Book Description

Author: Southeastern Conference on Combinatorics, Graph Theory, and Computing
Publisher:
ISBN:
Category : Combinatorial analysis
Languages : en
Pages : 568

Get Book

Book Description

Author:
Publisher:
ISBN:
Category : Union catalogs
Languages : en
Pages : 1028

Get Book

Book Description
Includes entries for maps and atlases.

Author: Library of Congress
Publisher:
ISBN:
Category :
Languages : en
Pages : 1038

Get Book

Book Description

Author: William G. Brown
Publisher:
ISBN:
Category : Graph theory
Languages : en
Pages : 350

Get Book

Book Description

Author: American Mathematical Society
Publisher: American Mathematical Society(RI)
ISBN:
Category : Mathematics
Languages : en
Pages : 572

Get Book

Book Description

Author: Library of Congress
Publisher:
ISBN:
Category :
Languages : en
Pages : 1040

Get Book

Book Description