MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Given a graph G, the Cheeger constant is defined by $$ \DeclareMathOperator{\Vol}{Vol} h_G := \min_{S \subseteq V, \Vol S \leq (\Vol G)/2} \frac{|\partial S|}{\Vol S}. $$ Here, $\Vol S$ is the sum of the degrees of the vertices in the subgraph induced by $S$. For $v \in V$, let $N_k(v) := \{w \in V : d(v,w) \leq k\}$.

Are there any results that indicate when $h_G$ might be well-approximated by taking $S$ to be some $N_k(v)$, for appropriate choices of $k$ and $v$? The complete graph shows that this cannot always work, but it seems like it might in some cases, such as certain classes of random graphs.

share|cite|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.