Extremal Combinatorial Problems and Their Applications

by B.S. Stechkin, V.I. Baranov

Overview

Combinatorial research has proceeded vigorously in Russia over the last few decades, based on both translated Western sources and original Russian material. The present volume extends the extremal approach to the solution of a large class of problems, including some that were hitherto regarded as exclusively algorithmic, and broadens the choice of theoretical bases for modelling real phenomena in order to solve practical problems.
Audience: Graduate students of mathematics and engineering interested in the thematics of extremal problems and in the field of combinatorics in general. Can be used both as a textbook and as a reference handbook.

Product Details

ISBN-13:	9780792336310
Publisher:	Springer Netherlands
Publication date:	08/31/1995
Series:	Mathematics and Its Applications , #335
Edition description:	1995
Pages:	210
Product dimensions:	6.10(w) x 9.25(h) x 0.02(d)

Table of Contents

Analysis Correspondence.- Some information from combinatorics.- Extremal problems on packability of number partitions.- Extremal problems on graphs and systems of sets.- Extremal geometrical problems.- Application of the results of solving extremal combinatorial problems.

Editorial Reviews

Part course text for advanced graduate students and beginning engineers and part reference for the more experienced, develops methods for solving practical and mathematical problems arising in the creation of automatic control systems. Covers information from combinatorics, extremal problems on the packability of number partitions and graphs and systems of sets, extremal geometrical problems, and applications of the results of solving extremal combinatorial problems. Translated and radically revised from the Russian edition; the field of combinatorics is far advanced in Russia but little of the information has come to the West. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Booknews