Advertisement

Sparsity pp 411-416 | Cite as

Further Directions

  • Jaroslav Nešetřil
  • Patrice Ossona de Mendez
Chapter
Part of the Algorithms and Combinatorics book series (AC, volume 28)

Abstract

Like every active area of mathematics our book leaves some intriguing and challenging problems open. They relate for example to better computations and improvements of provided bounds. In a way most of our results on logarithmic density are just the first order approximations which certainly can be improved on many places.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Jaroslav Nešetřil
    • 1
  • Patrice Ossona de Mendez
    • 2
  1. 1.Computer Science Institute of Charles University (IUUK) Department of Applied MathematicsCharles UniversityPragueCzech Republic
  2. 2.Mathématique Sociales (UMR 8557)CNRS Centre d’Analyse et deParisFrance

Personalised recommendations