Large induced subgraphs with three repeated degrees |
| |
Institution: | Center for Discrete Mathematics, Fuzhou University, Fujian 350003, China |
| |
Abstract: | For any positive integer k, let denote the least integer such that any n-vertex graph has an induced subgraph with at least vertices, in which at least vertices are of the same degree. Caro, Shapira and Yuster initially studied this parameter and showed that . For the first nontrivial case, the authors proved that , and the exact value was left as an open problem. In this paper, we first show that , improving the former result as well as a recent result of Kogan. For special families of graphs, we prove that for -free graphs, and for large -free graphs. In addition, extending a result of Erd?s, Fajtlowicz and Staton, we assert that every -free graph is an induced subgraph of a -free graph in which no degree occurs more than three times. |
| |
Keywords: | Induced subgraph Repeated degree |
本文献已被 ScienceDirect 等数据库收录! |
|