title: Planar graph memory
body: <p>I have a <a href="http://en.wikipedia.org/wiki/Planar_graph" rel="nofollow noreferrer">Planar graph</a> with <code>n</code> nodes and <code>e</code> edges that slices the plain into <code>s</code> section. </p>
  
  <p>What is the upper limit for <code>s</code> as a function of <code>n</code> and <code>e</code> and <code>e/n</code>?</p>
  
  <p>I'm trying to find how little memory I can count on some code using.</p>
  
  <hr>
  
  <p>It's easy to show that <code>e</code> is not more than <code>n*(n-1)/2</code> but I have a feeling that it's going to be a small integer. For a <code>n ~= 10</code> case I have with fixed node position, that overestimates the limit by a factor of 2.   </p>