No label defined (Q3972129)
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 15494
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 15494 |
Statements
25 June 1992
0 references
edge independence number
0 references
regular graph
0 references
edge connectivity
0 references
0.8462265729904175
0 references
0.8384650945663452
0 references
0.8061203956604004
0 references
0.8009420037269592
0 references
[For the entire collection see Zbl 0699.00014.] Let \(G\) be an \(r\)-regular, \((r-2)\)-edge-connected graph, \(r\geq 3\), of order \(p\) and let \(\ell\) be an integer such that \(0\leq \ell \leq \lfloor {p\over 2}\rfloor\). If \(p\) is even and \(p<2(\ell +1)(r \lfloor {r\over 2}\rfloor + r-1)\), then there are at least \((p-2\ell)/2\) independent edges in \(G\). Similar result for \(p\) odd is given and it is proved that for \(r\geq 4\) the bounds are best possible.
0 references
