Discrete mathematics

This is the most readable and thorough graduate textbook and reference for combinatorics, covering enumeration, graphs, sets, and methods.

Combinatorial design theory is a vibrant area of combinatorics, connecting graph theory, number theory, geometry, and algebra with applications in experimental design, coding theory, and numerous applications in computer science.

Covering a wide range of Random Graphs subjects, this volume examines series-parallel networks, properties of random subgraphs of the n-cube, random binary and recursive trees, random digraphs, induced subgraphs and spanning trees in random graphs as well as matchings, hamiltonian cycles and closure in such structures.

Most topics in near-ring and near-field theory are treated here, along with an extensive introduction to the theory.

A collection of papers surveying recent progress in the field of Combinatorial Optimization.

Interest in combinatorial techniques has been greatly enhanced by the applications they may offer in connection with computer technology.

This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case.

The range of random graph topics covered in this volume includes structure, colouring, algorithms, mappings, trees, network flows, and percolation.

This volume deals with a variety of problems involving cycles in graphs and circuits in digraphs.

The scope of the volume includes all algorithmic and computational aspects of research on combinatorial designs.

Combinatorial problems have been from the very beginning part of the history of mathematics.

This volume contains nine selected papers presented at the Borgholm conference.

Trees and Hills: Methodology for Maximizing Functions of Systems of Linear Relations

For the first time, this book unites different algebraic approaches for discrete optimization and operations research.

The purpose of this book is to present selected results on perfect graphs in a single volume.

Among the participants discussing recent trends in their respective fields and in areas of common interest in these proceedings are such world-famous geometers as H.

This work inaugurates a new and general solution method for arbitrary continuous nonlinear PDEs.

Group Representations Volume 1 Part B

Combinatorics '81

The object of this book is to provide an account of the results and methods used in combinatorial theories: Graph Theory, Matching Theory, Hamiltonian Problems, Hypergraph Theory, Designs, Steiner Systems, Latin Squares, Coding Matroids, Complexity Theory.

Bonn Workshop on Combinatorial Optimization

Algebraic and Geometric Combinatorics

Combinatorial and Geometric Structures and Their Applications

The Cambridge Graph Theory Conference, held at Trinity College from 11 to 13 March 1981, brought together top ranking workers from diverse areas of the subject.

Studies on Graphs and Discrete Programming

Graph Theory (as a recognized discipline) is a relative newcomer to Mathematics.

The Steiner problem asks for a shortest network which spans a given set of points.

This volume forms a valuable source of information on recent developments in research in combinatorics, with special regard to the geometric point of view.

This volume in the Annals of Discrete Mathematics brings together contributions by renowned researchers in combinatorics, graphs and complexity.

Eulerian Graphs and Related Topics

The Lukasiewicz-Moisil algebras were created by Moisil as an algebraic counterpart for the many-valued logics of Lukasiewicz.

The contributions in this volume are divided into three sections: theoretical, new models and algorithmic.

The importance of submodular functions has been widely recognized in recent years in combinatorial optimization.

Eulerian Graphs and Related Topics

Automata Theory is part of computability theory which covers problems in computer systems, software, activity of nervous systems (neural networks), and processes of live organisms development.

Combinatorics has not been an established branch of mathematics for very long: the last quarter of a century has seen an explosive growth in the subject.

Haim Hanani pioneered the techniques for constructing designs and the theory of pairwise balanced designs, leading directly to Wilson's Existence Theorem.

This volume is a tribute to the life and mathematical work of G.

This monograph is based on a series of lectures given by the author at the first Advanced Research Institute on Discrete Applied Mathematics, held at Rutgers University.

Graph Colouring and Variations

Graph Theory and Applications

Recent developments in all aspects of combinatorial and incidence geometry are covered in this volume, including their links with the foundations of geometry, graph theory and algebraic structures, and the applications to coding theory and computer science.

This volume presents four machine-independent theories of computational complexity, which have been chosen for their intrinsic importance and practical relevance.

Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems.

Linear and Combinatorial Optimization in Ordered Algebraic Structures

Combinatorics 79.

Combinatorics 79.

Topics on Steiner Systems

Combinatorial Mathematics, Optimal Designs, and Their Applications

Discrete Optimization I