Skip to main content

Introduction

  • Chapter
  • First Online:
Sparsity

Part of the book series: Algorithms and Combinatorics ((AC,volume 28))

  • 2701 Accesses

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.

Where the reader will learn why we wrote this book.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 99.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Publish with us

Policies and ethics