Does there exist a function f(r, n) such that each graph G with Z (G)≧f(r, n) contains either a complete subgraph of order r or else two non-neighboring n-chromatic subgraphs? It is known that f(r, 2) exists and we establish the existence of f(r, 3). We also give some interesting results about graphs which do not contain two independent edges.
- AMS subject classification (1980): 05C15
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Mathematics