|
|||||
|
|
Independent sets and repeated degrees |
|
| Authors: | B Bollobs A D Scott |
| Institution: | a Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, 16 Mill Lane, Cambridge, CB2 1SB, UK b Department of Mathematics, Louisiana State University, Baton Rouge, 070803, USA |
| Abstract: | We answer a question of Erdös, Faudree, Reid, Schelp and Staton by showing that for every integer k  2 there is a triangle-free graph G of order n such that no degree in G is repeated more than k times and ind(G) = (1 + o(1))n/k. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |