On the divisibility of homogeneous hypergraphs |
| |
Authors: | M. El-Zahar N. Sauer |
| |
Affiliation: | (1) Ain Shams University, Cairo, Egypt;(2) Kuwait University, P. O. BOX 5969, Kuwait;(3) University of Calgary, Calgary, Canada |
| |
Abstract: | We denote byKk,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 inK22 are the complete graphs. If is a subset ofKk 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 graphsHn have been shown to be indivisible, that is, for any partition ofHn into two classes, oue of the classes embeds an isomorphic copy ofHn. [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 Kk with 3 are indivisible. The-free hypergraphs with Kk2 satisfy a weaker form of indivisibility which was first shown by Henson [2] to hold forHn. 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 research has been supported by NSERC grant 69–1325. |
| |
Keywords: | 04 A 20 05 C 55 |
本文献已被 SpringerLink 等数据库收录! |
|