| Hardcover ISBN: | 978-0-8218-0963-1 |
| Product Code: | DIMACS/49 |
| List Price: | $124.00 |
| MAA Member Price: | $111.60 |
| AMS Member Price: | $99.20 |
| eBook ISBN: | 978-1-4704-4007-7 |
| Product Code: | DIMACS/49.E |
| List Price: | $117.00 |
| MAA Member Price: | $105.30 |
| AMS Member Price: | $93.60 |
| Hardcover ISBN: | 978-0-8218-0963-1 |
| eBook: ISBN: | 978-1-4704-4007-7 |
| Product Code: | DIMACS/49.B |
| List Price: | $241.00 $182.50 |
| MAA Member Price: | $216.90 $164.25 |
| AMS Member Price: | $192.80 $146.00 |
| Hardcover ISBN: | 978-0-8218-0963-1 |
| Product Code: | DIMACS/49 |
| List Price: | $124.00 |
| MAA Member Price: | $111.60 |
| AMS Member Price: | $99.20 |
| eBook ISBN: | 978-1-4704-4007-7 |
| Product Code: | DIMACS/49.E |
| List Price: | $117.00 |
| MAA Member Price: | $105.30 |
| AMS Member Price: | $93.60 |
| Hardcover ISBN: | 978-0-8218-0963-1 |
| eBook ISBN: | 978-1-4704-4007-7 |
| Product Code: | DIMACS/49.B |
| List Price: | $241.00 $182.50 |
| MAA Member Price: | $216.90 $164.25 |
| AMS Member Price: | $192.80 $146.00 |
-
Book DetailsDIMACS - Series in Discrete Mathematics and Theoretical Computer ScienceVolume: 49; 1999; 389 ppMSC: Primary 05; 06; 11; 60; 68; 92
Discrete mathematics stands among the leading disciplines of mathematics and theoretical computer science. This is due primarily to its increasing role in university curricula and its growing importance in applications ranging from optimization to molecular biology. An inaugural conference was held cooperatively by DIMATIA and DIMACS to focus on the versatility, width, and depth of current progress in the subject area.
This volume offers a well-balanced blend of research and survey papers reflecting the exciting, attractive topics in contemporary discrete mathematics. Discussed in the book are topics such as graph theory, partially ordered sets, geometrical Ramsey theory, computational complexity issues and applications.
Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).
ReadershipGraduate students and research mathematicians interested in discrete mathematics, theoretical computer science and applications; operations research scientists and computer scientists.
-
Table of Contents
-
Chapters
-
Acyclic improper colourings of graphs with bounded degree
-
Intersection graphs of Jordan arcs
-
Linear and nonlinear systems: A survey
-
Parameterized complexity: A framework for systematically confronting computational intractability
-
On the structure of large homothetic subsets
-
The complexity of an inverse shortest paths problem
-
Finding minimum weighted generators of a path system
-
On the distribution of sums of vectors in general position
-
The generalized matching problem on partial $k$-trees
-
Bases of cocycle lattices and submatrices of a Hadamard matrix
-
On the maximum lengths of Davenport-Schinzel sequences
-
On the minimum number of edges giving maximum oriented chromatic number
-
New trends in the theory of graph colorings: Choosability and list coloring
-
Topological minors in graphs of minimum degree $n$
-
Reducible properties and uniquely partitionable graphs
-
Induced monochromatic subconfigurations
-
Density
-
Spectra, graphs, and proteins. Towards understanding of protein folding
-
Meaningless statements
-
Graceful matchings in finite fields, the factor-difference sets of integers, and integers of the form $a^2 + kb^2$
-
How to solve a Turán type extremal graph problem? (Linear decomposition)
-
Oriented list colouring of undirected graphs
-
On the limit values of probabilities for the first order properties of graphs
-
Ramsey theory and partially ordered sets
-
Generalizations of Davenport-Schinzel sequences
-
-
RequestsReview Copy – for publishers of book reviewsAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Requests
Discrete mathematics stands among the leading disciplines of mathematics and theoretical computer science. This is due primarily to its increasing role in university curricula and its growing importance in applications ranging from optimization to molecular biology. An inaugural conference was held cooperatively by DIMATIA and DIMACS to focus on the versatility, width, and depth of current progress in the subject area.
This volume offers a well-balanced blend of research and survey papers reflecting the exciting, attractive topics in contemporary discrete mathematics. Discussed in the book are topics such as graph theory, partially ordered sets, geometrical Ramsey theory, computational complexity issues and applications.
Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).
Graduate students and research mathematicians interested in discrete mathematics, theoretical computer science and applications; operations research scientists and computer scientists.
-
Chapters
-
Acyclic improper colourings of graphs with bounded degree
-
Intersection graphs of Jordan arcs
-
Linear and nonlinear systems: A survey
-
Parameterized complexity: A framework for systematically confronting computational intractability
-
On the structure of large homothetic subsets
-
The complexity of an inverse shortest paths problem
-
Finding minimum weighted generators of a path system
-
On the distribution of sums of vectors in general position
-
The generalized matching problem on partial $k$-trees
-
Bases of cocycle lattices and submatrices of a Hadamard matrix
-
On the maximum lengths of Davenport-Schinzel sequences
-
On the minimum number of edges giving maximum oriented chromatic number
-
New trends in the theory of graph colorings: Choosability and list coloring
-
Topological minors in graphs of minimum degree $n$
-
Reducible properties and uniquely partitionable graphs
-
Induced monochromatic subconfigurations
-
Density
-
Spectra, graphs, and proteins. Towards understanding of protein folding
-
Meaningless statements
-
Graceful matchings in finite fields, the factor-difference sets of integers, and integers of the form $a^2 + kb^2$
-
How to solve a Turán type extremal graph problem? (Linear decomposition)
-
Oriented list colouring of undirected graphs
-
On the limit values of probabilities for the first order properties of graphs
-
Ramsey theory and partially ordered sets
-
Generalizations of Davenport-Schinzel sequences
