论文信息 - On countable homogeneous 3-hypergraphs - 字舞流文

On countable homogeneous 3-hypergraphs

SummaryWe present some results on countable homogeneous 3-hypergraphs. In particular, we show that there is no unexpected homogeneous 3-hypergraph determined by a single constraint.

Reza Akhtar | Alistair H. Lachlan

[1] Christian Ronse,et al. On Homogeneous Graphs , 1978 .

[2] A. H. Lachlan,et al. Countable homogeneous tournaments , 1984 .

[3] R. Woodrow,et al. Countable ultrahomogeneous undirected graphs , 1980 .

[4] Robert E. Woodrow,et al. There are four countable ultrahomogeneous graphs without triangles , 1979, J. Comb. Theory, Ser. B.

[5] Gregory L. Cherlin. Homogeneous directed graphs. The imprimitive case , 1985, Logic Colloquium.

[6] A. Lachlan. Binary Homogeneous Structures II , 1986 .

[7] Alistair H. Lachlan,et al. Finite Homogeneous 3-Graphs , 1995, Math. Log. Q..

[8] Vaught,et al. A family of countable homogeneous graphs , 1971 .

[9] R. Fraïssé. Sur l'extension aux relations de quelques propriétés des ordres , 1954 .