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

메뉴 건너뛰기

Electronic Journal of Combinatorics

Volumn 8, Issue 2, 2001, Pages

A finite word poset

(3) Erdos, Péter L a Sziklai, Péter b Torney, David C c

a INSTITUTE OF EXPERIMENTAL MEDICINE (Hungary)

b EÖTVÖS LORÁND UNIVERSITY (Hungary)

c LOS ALAMOS NATIONAL LABORATORY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 53949101582 PISSN: 10778926 EISSN: 10778926 Source Type: Journal
DOI: None Document Type: Article

Times cited : (3)

References (17)

1
- 0004033326
- Springer-Verlag, Berlin
- M. Aigner: Combinatorial Theory, Springer-Verlag, Berlin, 1979, p. 428.
- (1979) Combinatorial Theory , pp. 428
- Aigner, M.¹

2
- 0000981526
- On generalized graphs
- B. Bollobas: On generalized graphs, Ada Math. Acad. Sci. Hung. 16 (1965), 447-452.
- (1965) Ada Math. Acad. Sci. Hung. , vol.16 , pp. 447-452
- Bollobas, B.¹

3
- 0002894368
- HarperCollins Publishers, New York
- E. J. Borowski and J. M. Borwein: The HarperCollins Dictionary of Mathematics, HarperCollins Publishers, New York, 1991.
- (1991) The HarperCollins Dictionary of Mathematics
- Borowski, E.J.¹ Borwein, J.M.²

4
- 0043223239
- Über Ordnungen von Binärworten
- G. Burosch, U. Franke, S. Röhl: Über Ordnungen von Binärworten, Rostock. Math. Kolloq. 39 (1990), 53-64.
- (1990) Rostock. Math. Kolloq. , vol.39 , pp. 53-64
- Burosch, G.¹ Franke, U.² Röhl, S.³

5
- 0043223244
- On posets of m-ary words
- G. Burosch, H-D. Gronau, J-M. Laborde: On posets of m-ary words, Discrete Math. 152 (1996), 69-91.
- (1996) Discrete Math. , vol.152 , pp. 69-91
- Burosch, G.¹ Gronau, H.-D.² Laborde, J.-M.³

6
- 33746078387
- Subsequence numbers and logarithmic concavity
- P.J. Chase: Subsequence numbers and logarithmic concavity, Discrete Math. 16 (1976), 123-140.
- (1976) Discrete Math. , vol.16 , pp. 123-140
- Chase, P.J.¹

7
- 0004137004
- Cambridge University Press, Cambridge
- D. Gusfield: Algorithms on Strings, Trees and Sequences, Cambridge University Press, Cambridge, 1997.
- (1997) Algorithms on Strings, Trees and Sequences
- Gusfield, D.¹

8
- 0008385568
- The morphology of partially ordered sets
- L.H. Harper: The morphology of partially ordered sets, J. Comb. Theory (A) 17 (1974), 44-59.
- (1974) J. Comb. Theory (A) , vol.17 , pp. 44-59
- Harper, L.H.¹

9
- 84963086911
- Ordering by divisibility in abstract algebra
- G. Higman: Ordering by divisibility in abstract algebra, Proc. London Math. Soc. 2 (1953), 326-336.
- (1953) Proc. London Math. Soc. , vol.2 , pp. 326-336
- Higman, G.¹

10
- 0027634581
- A relation between Levenshtein-type distances and insertion-anddeletion correcting capabilities of codes
- H.D.L. Hollmann: A relation between Levenshtein-type distances and insertion-anddeletion correcting capabilities of codes, IEEE Trans, on Information Theory 39 (1993), 1424-1427.
- (1993) IEEE Trans, on Information Theory , vol.39 , pp. 1424-1427
- Hollmann, H.D.L.¹

11
- 0042620319
- On an extremal property of antichains in partially orders. the LYM property and some of its implications and applications
- Hall & van Lints, eds. Math. Centre Tracts Amsterdam
- D.J. Kleitman: On an extremal property of antichains in partially orders. The LYM property and some of its implications and applications, Combinatorics (Hall & van Lints, eds.) Math. Centre Tracts 56 Amsterdam, (1974) 77-90.
- (1974) Combinatorics , vol.56 , pp. 77-90
- Kleitman, D.J.¹

12
- 0000633940
- On perfect codes in deletion and insertion metric
- V.I. Levenshtein: On perfect codes in deletion and insertion metric, Discrete Math. Appl. 2 (1992), 241-258.
- (1992) Discrete Math. Appl. , vol.2 , pp. 241-258
- Levenshtein, V.I.¹

13
- 0004157169
- Cambridge University Press, Cambridge
- M. Lothaire: Combinatorics on words, Cambridge University Press, Cambridge, 1997.
- (1997) Combinatorics on Words
- Lothaire, M.¹

14
- 58149418088
- A short proof of Sperner's lemma
- D. Lubell: A short proof of Sperner's lemma, J. Combin. Theory, 1 (1966), 299.
- (1966) J. Combin. Theory , vol.1 , pp. 299
- Lubell, D.¹

15
- 0001587111
- A generalization of Sperner's theorem on the number of subsets of a finite set, (Russian)
- L.D. Meshalkin: A generalization of Sperner's theorem on the number of subsets of a finite set, (Russian) Teor. Verojatnost. i Primenen 8 (1963), 219-220.
- (1963) Teor. Verojatnost. i Primenen , vol.8 , pp. 219-220
- Meshalkin, L.D.¹

16
- 0000657407
- Ein Satz über Untermengen einer endlichen Menge
- E. Sperner: Ein Satz über Untermengen einer endlichen Menge, Math. Z. 27 (1928), 544-548.
- (1928) Math. Z. , vol.27 , pp. 544-548
- Sperner, E.¹

17
- 84972500495
- Logarithmic order of free distributive lattice
- K. Yamamoto: Logarithmic order of free distributive lattice, J. Math. Soc. Japan 6 (1954), 343-353.
- (1954) J. Math. Soc. Japan , vol.6 , pp. 343-353
- Yamamoto, K.¹

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