| Autor: |
Erdős, P., Faudree, R.J., Rousseau, C.C., Schelp, R.H. |
| Zdroj: |
Discrete Mathematics; November 1990, Vol. 85 Issue: 1 p53-58, 6p |
| Abstrakt: |
For k⩾ 2, any graph Gwith nvertices and (k−1)(n−k+2)+(2k−2)edges has a subrgraph of minimum degree at least k; however, this subgraph need not be proper. It is shown that if Ghas at least (k−1)(n−k+2)+(2k−2)+1 edges, then there is a subgraph Hof minimal degree kthat has at most n − √n;√6k3vertices. Also, conditions that insure the existense of smaller subgraphs of minimum degree kare given. |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
