Edge isoperimetric method: at least \(2 / 3\) of \(h\)-extra edge-connectivity of a kind of cube-based graphs concentrates on \(2^{n - 1}\) (Q6992273)
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 8031939
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge isoperimetric method: at least \(2 / 3\) of \(h\)-extra edge-connectivity of a kind of cube-based graphs concentrates on \(2^{n - 1}\) |
scientific article; zbMATH DE number 8031939 |
Statements
Edge isoperimetric method: at least \(2 / 3\) of \(h\)-extra edge-connectivity of a kind of cube-based graphs concentrates on \(2^{n - 1}\) (English)
0 references
28 April 2025
0 references
edge isoperimetric method
0 references
connectivity
0 references
concentration phenomenon
0 references
perfect matching
0 references
0 references
0 references
0 references
0 references
0 references
