Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
1 answer
211 views

The complexity of expansion ratio (Cheeger constant) of a graph

Let $G=(V(G), E(G))$ be a graph on $n$ vertices and let $S$ be a subset of $V(G)$. The boundary of $S$, denoted by $\partial S$, is the set of edges $(i, j)$ such that $i \in S$ and $j \in V(G) \...
Ranveer Singh's user avatar