Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
The following link can be shared to navigate to this page. You can select the link to copy or click the 'Copy To Clipboard' button below.
Copy To Clipboard
Successfully Copied!
Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future
 
Edited by: Ronald L. Graham A T&T Labs—Research, Florham Park, NJ
Jan Kratochvíl DIMATIA Charles University, Prague, Czech Republic
Jaroslav Nešetřil DIMATIA Charles University, Prague, Czech Republic
Fred S. Roberts DIMACS, Rutgers University, Piscataway, NJ
A co-publication of the AMS and DIMACS
Front Cover for Contemporary Trends in Discrete Mathematics
Available Formats:
Hardcover ISBN: 978-0-8218-0963-1
Product Code: DIMACS/49
List Price: $118.00
MAA Member Price: $106.20
AMS Member Price: $94.40
Electronic ISBN: 978-1-4704-4007-7
Product Code: DIMACS/49.E
List Price: $111.00
MAA Member Price: $99.90
AMS Member Price: $88.80
Bundle Print and Electronic Formats and Save!
This product is available for purchase as a bundle. Purchasing as a bundle enables you to save on the electronic version.
List Price: $177.00
MAA Member Price: $159.30
AMS Member Price: $141.60
Front Cover for Contemporary Trends in Discrete Mathematics
Click above image for expanded view
  • Front Cover for Contemporary Trends in Discrete Mathematics
  • Back Cover for Contemporary Trends in Discrete Mathematics
Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future
Edited by: Ronald L. Graham A T&T Labs—Research, Florham Park, NJ
Jan Kratochvíl DIMATIA Charles University, Prague, Czech Republic
Jaroslav Nešetřil DIMATIA Charles University, Prague, Czech Republic
Fred S. Roberts DIMACS, Rutgers University, Piscataway, NJ
A co-publication of the AMS and DIMACS
Available Formats:
Hardcover ISBN:  978-0-8218-0963-1
Product Code:  DIMACS/49
List Price: $118.00
MAA Member Price: $106.20
AMS Member Price: $94.40
Electronic ISBN:  978-1-4704-4007-7
Product Code:  DIMACS/49.E
List Price: $111.00
MAA Member Price: $99.90
AMS Member Price: $88.80
Bundle Print and Electronic Formats and Save!
This product is available for purchase as a bundle. Purchasing as a bundle enables you to save on the electronic version.
List Price: $177.00
MAA Member Price: $159.30
AMS Member Price: $141.60
  • Book Details
     
     
    DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
    Volume: 491999; 389 pp
    MSC: 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.

    Readership

    Graduate 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
  • Request Review Copy
Volume: 491999; 389 pp
MSC: 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.

Readership

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
Please select which format for which you are requesting permissions.