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


Does there exist a functionf(r, n) such that each graphG with Z (G)≧f(r, n) contains either a complete subgraph of orderr or else two non-neighboringn-chromatic subgraphs? It is known thatf(r, 2) exists and we establish the existence off(r, 3). We also give some interesting results about graphs which do not contain two independent edges.

This is a preview of subscription content, access via your institution.


  1. [1]

    J. Mycielski, Sur le coloriage des graphes,Colloq. Math.3 (1955), 161–162.

    MATH  MathSciNet  Google Scholar 

  2. [2]

    S. Wagon, A bound on the chromatic number of graphs without certain induced subgraphs,J. Combinatorial Theory Ser. B29 (1980), 345–346.

    MATH  Article  MathSciNet  Google Scholar 

  3. [3]

    P. Erdős, On circuits and subgraphs of chromatic graphs,Mathematika9 (1962), 170–175.

    MathSciNet  Article  Google Scholar 

Download references

Author information



Rights and permissions

Reprints and Permissions

About this article

Cite this article

El-Zahar, M., Erdős, P. On the existence of two non-neighboring subgraphs in a graph. Combinatorica 5, 295–300 (1985). https://doi.org/10.1007/BF02579243

Download citation

AMS subject classification (1980)

  • 05 C 15