SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

European Journal of Combinatorics

Volumn 24, Issue 6, 2003, Pages 649-663

On the order of countable graphs

(2) Nešetřil, Jaroslav a Shelah, Saharon b,c

a CHARLES UNIVERSITY (Czech Republic)

b HEBREW UNIVERSITY OF JERUSALEM (Israel)

c RUTGERS UNIVERSITY (United States)

Author keywords

Density; Partially ordered sets; Rigid graphs; Universal graphs

Indexed keywords

EID: 17944397060 PISSN: 01956698 EISSN: None Source Type: Journal
DOI: 10.1016/S0195-6698(03)00064-7 Document Type: Article

Times cited : (19)

References (21)

1
- 0039681419
- Universal graphs with forbidden subgraphs and algebraic closure
- Cherlin G. Shelah S. Shi N. Universal graphs with forbidden subgraphs and algebraic closure Adv. Appl. Math. 22 1999 454 491
- (1999) Adv. Appl. Math. , vol.22 , pp. 454-491
- Cherlin, G.¹ Shelah, S.² Shi, N.³

2
- 4243749280
- Every finite graph is a full subgraph of a rigid graph
- Chvátal V. Hell P. Kučera L. Nešetřil J. Every finite graph is a full subgraph of a rigid graph J. Combin. Theory 11 3 1971 184 286
- (1971) J. Combin. Theory , vol.11 , Issue.3 , pp. 184-286
- Chvátal, V.¹ Hell, P.² Kučera, L.³ Nešetřil, J.⁴

3
- 0041405971
- High chromatic rigid graphs II
- Babai L. Nešetřil J. High chromatic rigid graphs II Ann. Discrete Math. 15 1982 55 61
- (1982) Ann. Discrete Math. , vol.15 , pp. 55-61
- Babai, L.¹ Nešetřil, J.²

4
- 84972582231
- A family of countable homogeneous graphs
- Ward Henson C. A family of countable homogeneous graphs Pacific J. Math. 38 1971 69 83
- (1971) Pacific J. Math. , vol.38 , pp. 69-83
- Ward Henson, C.¹

5
- 0000705759
- Universal relational systems
- Jónsson B. Universal relational systems Math. Scand. 4 1956 193 208
- (1956) Math. Scand. , vol.4 , pp. 193-208
- Jónsson, B.¹

6
- 84968520217
- Universal infinite partially orderd sets
- Johnston J.B. Universal infinite partially orderd sets Proc. Amer. Math. Soc. 7 1956 507 514
- (1956) Proc. Amer. Math. Soc. , vol.7 , pp. 507-514
- Johnston, J.B.¹

7
- 0004178479
- The higher infinite
- Berlin: Springer-Verlag
- Kanamori A. The higher infinite Large Cardinals in Set Theory from Their Beginnings: Perspectives in Math. Logic 1994 Springer-Verlag Berlin
- (1994) Large Cardinals in Set Theory from Their Beginnings, Perspectives in Math. Logic
- Kanamori, A.¹

8
- 51249176695
- Some universal graphs
- Komjáth P. Mekler A. Pach J. Some universal graphs Israel J. Math. 64 1998 158 168
- (1998) Israel J. Math. , vol.64 , pp. 158-168
- Komjáth, P.¹ Mekler, A.² Pach, J.³

9
- 84974122267
- Universal graphs without large bipartite subgraphs
- Komjáth P. Pach J. Universal graphs without large bipartite subgraphs Mathematika 31 1984 282 290
- (1984) Mathematika , vol.31 , pp. 282-290
- Komjáth, P.¹ Pach, J.²

10
- 0010360914
- The homomorphism structure of classes of graphs
- Nešetřil J. The homomorphism structure of classes of graphs Combin. Probab. Comput. 8 1999 177 184
- (1999) Combin. Probab. Comput. , vol.8 , pp. 177-184
- Nešetřil, J.¹

11
- 4243458083
- The Coloring Poset and its On-Line Universality
- KAM Series
- J. Nešetřil, The Coloring Poset and its On-Line Universality, KAM Series, 2000, pp. 2000-2458
- (2000) , pp. 2000-2458
- Nešetřil, J.¹

12
- 4243810104
- Universality and Homomorphism Order
- (in preparation)
- J. Nešetřil, Universality and Homomorphism Order (in preparation)
- Nešetřil, J.¹

13
- 17544401208
- Aspects of structural combinatorics (graph homomorphisms and their use)
- Nešetřil J. Aspects of structural combinatorics (graph homomorphisms and their use) Taiwanese J. Math. 3 4 1999 381 424
- (1999) Taiwanese J. Math. , vol.3 , Issue.4 , pp. 381-424
- Nešetřil, J.¹

14
- 31244432824
- A rigid graph for every set
- Nešetřil J. A rigid graph for every set J. Graph Theory 39 2 2002 108 110
- (2002) J. Graph Theory , vol.39 , Issue.2 , pp. 108-110
- Nešetřil, J.¹

15
- 0040560409
- Chromatically optimal rigid graphs
- Nešetřil J. Rödl V. Chromatically optimal rigid graphs J. Combin. Theory Ser. B 46 1989 133 141
- (1989) J. Combin. Theory Ser. B , vol.46 , pp. 133-141
- Nešetřil, J.¹ Rödl, V.²

16
- 4243472778
- Density
- R. L. Graham, J. Kratochvíl, J. Nešetřil, & F. S. Roberts (Eds.), American Mathematical Society
- Nešetřil J. Tardif C. Density in: Graham R.L. Kratochvíl J. Nešetřil J. Roberts F.S. (Eds.), Contemporary Trends in Discrete Mathematics 1999 229 237 American Mathematical Society
- (1999) Contemporary Trends in Discrete Mathematics , pp. 229-237
- Nešetřil, J.¹ Tardif, C.²

17
- 17744411843
- Duality theorems for finite structures (characterizing gaps and good characterizations)
- Nešetřil J. Tardif C. Duality theorems for finite structures (characterizing gaps and good characterizations) J. Combin. Theory Ser. B 80 2000 80 97
- (2000) J. Combin. Theory Ser. B , vol.80 , pp. 80-97
- Nešetřil, J.¹ Tardif, C.²

18
- 0003621974
- Combinatorial, Algebraic and Topological Representations of Groups
- Semigroups and Categories, North-Holland
- A. Pultr, V. Trnková, Combinatorial, Algebraic and Topological Representations of Groups, Semigroups and Categories, North-Holland, 1980
- (1980)
- Pultr, A.¹ Trnková, V.²

19
- 0001012216
- Universal graphs and universal functions
- Rado R. Universal graphs and universal functions Acta Arith. 9 1964 331 340
- (1964) Acta Arith. , vol.9 , pp. 331-340
- Rado, R.¹

20
- 0002723901
- Color families are dense
- Welzl E. Color families are dense J. Theoret. Comput. Sci. 17 1982 29 41
- (1982) J. Theoret. Comput. Sci. , vol.17 , pp. 29-41
- Welzl, E.¹

21
- 0000965960
- A rigid relation exists on any set
- P. Vopěnka, A. Pultr, Z. Hedrlíin, A rigid relation exists on any set, Comment. Math. Univ. Carolin. 6 (1965) 149 155
- (1965) Comment. Math. Univ. Carolin. , vol.6 , pp. 149-155
- Vopěnka, P.¹ Pultr, A.² Hedrlíin, Z.³

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.