Advertisement

Sparsity pp 417-429 | Cite as

Solutions and Hints for some of the Exercises

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

Abstract

3.1 For \(A \subseteq V(G)\) let f(A) be the number of edges between A and \( V(G)/A \). Let A be such that f(A) is maximal. No vertex \(\nu \in A\) has more neighbors in A than in V(G)\A as we would have f\((A-\nu) > A\).

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