On Minimal Prime Graphs and Posets

被引：0
作者：
Maurice Pouzet
Imed Zaguia
机构：
[1] Université Claude-Bernard Lyon 1,ICJ
[2] The University of Calgary,Department of Mathematics and Statistics
[3] Sultan Qaboos University,Department of Mathematics & Statistics
来源：
Order | 2009年 / 26卷
关键词：
Prime graph; Prime poset; The neighborhood lattice of a graph; Incidence structure; Galois lattice; Ramsey theorem; 06A06; 06A07;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We show that there are four infinite prime graphs such that every infinite prime graph with no infinite clique embeds one of these graphs. We derive a similar result for infinite prime posets with no infinite chain or no infinite antichain.
引用
收藏
页码：357 / 375
页数：18
相关论文
共 15 条
[1]  
Boudabbous Y(2009)The morphology of infinite tournaments. Application to the growth of their profile. Presented at the CGCS-2007 Conference in Honor of Michel Deza European Journal of Combinatorics 35 39-52
[2]  
Pouzet M(1981)Complete ordered sets with no infinite antichains Discrete Math. 63 600-610
[3]  
Duffus D(1941)Partially ordered sets Am. J. Math. 18 25-66
[4]  
Pouzet M(1967)Transitiv orientierbare Graphen Acta Math. Acad. Sci. Hung. 3 272-285
[5]  
Rival I(2005)A characterization of the indecomposable and infinite graphs Glob. J. Pure Appl. Math. 53 287-299
[6]  
Dushnik B(2005)Which posets have a scattered MacNeille completion? Algebra Univers. 30 264-286
[7]  
Miller EW(1930)On a problem of formal logic Proc. Lond. Math. Soc. II 5 179-187
[8]  
Gallai T(1973)Point determination in graphs Discrete Math. 6 281-298
[9]  
Ille P(1973)Graphs indecomposable with respect to the Discrete Math. undefined undefined-undefined
[10]  
Pouzet M(undefined)-join undefined undefined undefined-undefined
12