Contemporary Trends in Discrete Mathematics :From DIMACS and DIMATIA to the Future ( DIMACS - Series in Discrete Mathematics and Theoretical Computer Science )

Publication subTitle :From DIMACS and DIMATIA to the Future

Publication series :DIMACS - Series in Discrete Mathematics and Theoretical Computer Science

Author: Ronald L. Graham;Jan Kratochvíl;Jaroslav Nešetřil  

Publisher: American Mathematical Society‎

Publication year: 2017

E-ISBN: 9781470440077

P-ISBN(Paperback): 9780821809631

Subject: O1 Mathematics

Keyword: 暂无分类

Language: ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Contemporary Trends in Discrete Mathematics

Description

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.

Chapter

Frontispiece

Title page

Contents

Foreword

Preface

Program

List of participants

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 𝑘-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 𝑛

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 𝑎²+𝑘𝑏²

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

Back Cover

The users who browse this book also browse


No browse record.