Abstract
It is shown that any graph on n vertices containing no clique and no independent set on t + 1 vertices has at least {Mathematical expression} distinct induced subgraphs.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1-6 |
| Number of pages | 6 |
| Journal | Graphs and Combinatorics |
| Volume | 7 |
| Issue number | 1 |
| DOIs | |
| State | Published - Mar 1991 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics