Every graph with a positive Cheeger constant contains a tree with a positive Cheeger constant (Q1365199): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Itai Benjamini / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Oded Schramm / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Dietmar Cieslik / rank | |||
Normal rank |
Revision as of 07:25, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Every graph with a positive Cheeger constant contains a tree with a positive Cheeger constant |
scientific article |
Statements
Every graph with a positive Cheeger constant contains a tree with a positive Cheeger constant (English)
0 references
28 August 1997
0 references
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.
0 references
infinite graph
0 references
Cheeger constant
0 references
tree
0 references