No label defined (Q4250148)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1303526
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1303526 |
Statements
13 December 1999
0 references
isoperimetric problem
0 references
isoperimetric inequality
0 references
lexicographic order
0 references
local-global principle
0 references
graph partitions
0 references
0.7606270909309387
0 references
0.7506202459335327
0 references
0.738284707069397
0 references
Let \(G=(V,E)\) be a simple connected graph. For \(A\subseteq V\) let \(I(A): =\{uv\in E:u,v\in A\}\) and \(\Theta (A):= \{uv\in E:u \in A,\;v\notin A\}\). The author presents in this helpful survey results and methods concerning the determination or estimation of \(\max\{| I(A)|: | A|= m\}\) and \(\min\{| \Theta(A) |: | A|= m\}\) for several graph classes. In addition, related problems on posets, supermodular functions, and graph partitions are presented and applications are discussed. For the entire collection see [Zbl 0910.00036].
0 references