Andrásfai, B. and Erdős, Pál and T. Sós, Vera (1974) On the connection between chromatic number, maximal clique and minimal degree of a graph. DISCRETE MATHEMATICS, 8 (3). pp. 205-218. ISSN 0012-365X
|
Text
1974-18.pdf Download (1MB) | Preview |
Official URL: http://doi.org/10.1016/0012-365X(74)90133-2
Abstract
Let Gn be a graph of n vertices, having chromatic number r which contains no complete graph of r vertices. Then Gn contains a vertex of degree not exceeding n(3r-7)/(3r-4). The result is essentially best possible. © 1974.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika Q Science / természettudomány > QA Mathematics / matematika > QA166-QA166.245 Graphs theory / gráfelmélet |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 25 Jun 2020 16:55 |
| Last Modified: | 31 Mar 2023 06:57 |
| URI: | http://real.mtak.hu/id/eprint/110445 |
Actions (login required)
 |
Edit Item |
