On the divisibility of homogeneous hypergraphs


We denote byK k ,k, ℓ≥2, the set of allk-uniform hypergraphsK which have the property that every ℓ element subset of the base ofK is a subset of one of the hyperedges ofK. So, the only element inK 22 are the complete graphs. If ℐ is a subset ofK k then there is exactly one homogeneous hypergraphH whose age is the set of all finite hypergraphs which do not embed any element of ℐ. We callH -free homogeneous graphsH n have been shown to be indivisible, that is, for any partition ofH n into two classes, oue of the classes embeds an isomorphic copy ofH n . [5]. Here we will investigate this question of indivisibility in the more general context ofℐ-free homogeneous hypergraphs. We will derive a general necessary condition for a homogeneous structure to be indivisible and prove that allℐ-free hypergraphs for ℐ ⊂K k with ℓ≥3 are indivisible. Theℐ-free hypergraphs with ℐ ⊂K 2 k satisfy a weaker form of indivisibility which was first shown by Henson [2] to hold forH n . The general necessary condition for homogeneous structures to be indivisible will then be used to show that not allℐ-free homogeneous hypergraphs are indivisible.

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


  1. [1]

    R. Fraïssé: Theory of relations, studies in logic and foundations of mathematics118 (1986), Elsevier Science Publishing Co., Inc., U.S.A.

    Google Scholar 

  2. [2]

    C. W. Henson: A family of countable homogeneous graphs,Pacifi Journal of Mathematics 38 (1), (1971).

  3. [3]

    M. Pouzet: Relations Impartibles,Dissertationes mat. CXCIII, Warszawa, 1981.

  4. [4]

    M. El-Zahar, andN. W. Sauer: Ramsey-type properties of relational structures, to appear inDiscrete Mathematics.

  5. [5]

    M. El-Zahar, andN. W. Sauer: The indivisibility of the homogeneousK n -free graphs,J. C. T. B. 27 (2), Oct. 1989.

  6. [6]

    A. H. Lachlan andR. E. Woodrow: Countable ultrahomogeneous undirected graphs,Trans. Amer. Math. Soc. 262 (1980), 51–94.

    Google Scholar 

  7. [7]

    P. Komjáth andV. Rödl: Coloring of universal graphs,Graphs and Combinatorics 2 (1986), 55–60.

    Google Scholar 

Download references

Author information



Additional information

This research has been supported by NSERC grant 69–1325.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

El-Zahar, M., Sauer, N. On the divisibility of homogeneous hypergraphs. Combinatorica 14, 159–165 (1994). https://doi.org/10.1007/BF01215348

Download citation

AMS subject classification code (1991)

  • 04 A 20
  • 05 C 55