Every graph with a positive Cheeger constant contains a tree with a positive Cheeger constant (Q1365199): Difference between revisions

Let \(G= (V,E)\) be an infinite graph which is locally finite. The Cheeger constant of \(G\) is defined by \[ h(G)=\inf\Biggl\{{|\partial K|\over|K|}: K\text{ a finite nonempty subset of }V\Biggr\}, \] whereby \(\partial K\) denotes the set of all vertices in \(V-K\) that have a neighbor in \(K\). The paper discusses the conjecture that every graph with a positive Cheeger constant contains a tree with a positive Cheeger constant and proves a structure theorem for graphs with an integer Cheeger constant.