On the existence of two non-neighboring subgraphs in a graph

M. El-Zahar, P. Erdős

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)295-300
Number of pages6
JournalCombinatorica
Volume5
Issue number4
DOIs
Publication statusPublished - Dec 1985

    Fingerprint

Keywords

  • AMS subject classification (1980): 05C15

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics

Cite this