Abstract
Combinatorics is a long story. But we believe that we live in the unique point of scientific history when combinatorics is becoming an essential part of mathematics and when the rich techniques developed in isolated and specific contexts are put to service in solving problems which are of general mathematical and scientific interest.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Where the reader will learn why we wrote this book.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nešetřil, J., de Mendez, P.O. (2012). Introduction. In: Sparsity. Algorithms and Combinatorics, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27875-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-27875-4_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27874-7
Online ISBN: 978-3-642-27875-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)