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.
Author(s): Boris S. Stechkin, Valeriy I. Baranov (auth.)
Series: Mathematics and Its Applications 335
Edition: 1
Publisher: Springer Netherlands
Year: 1995
Language: English
Commentary: +OCR
Pages: 210
City: Dordrecht; Boston
Tags: Discrete Mathematics in Computer Science; Combinatorics; Number Theory; Computer Science, general; Mathematics, general
Front Matter....Pages I-XIV
Analysis Correspondence....Pages 1-6
Some information from combinatorics....Pages 7-47
Extremal problems on packability of number partitions....Pages 49-99
Extremal problems on graphs and systems of sets....Pages 101-135
Extremal geometrical problems....Pages 137-154
Application of the results of solving extremal combinatorial problems....Pages 155-187
Back Matter....Pages 189-210
