Transitivity and partial order
Mathematica Bohemica, Tome 122 (1997) no. 1, pp. 75-82

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

DOI MR   Zbl

In this paper we find a one-to-one correspondence between transitive relations and partial orders. On the basis of this correspondence we deduce the recurrence formula for enumeration of their numbers. We also determine the number of all transitive relations on an arbitrary $n$-element set up to $n=14$.
In this paper we find a one-to-one correspondence between transitive relations and partial orders. On the basis of this correspondence we deduce the recurrence formula for enumeration of their numbers. We also determine the number of all transitive relations on an arbitrary $n$-element set up to $n=14$.
DOI : 10.21136/MB.1997.126183
Classification : 04A05, 05A15, 06A07, 54A10
Keywords: enumeration; transitivity; partial order
Klaška, Jiří. Transitivity and partial order. Mathematica Bohemica, Tome 122 (1997) no. 1, pp. 75-82. doi: 10.21136/MB.1997.126183
@article{10_21136_MB_1997_126183,
     author = {Kla\v{s}ka, Ji\v{r}{\'\i}},
     title = {Transitivity and partial order},
     journal = {Mathematica Bohemica},
     pages = {75--82},
     year = {1997},
     volume = {122},
     number = {1},
     doi = {10.21136/MB.1997.126183},
     mrnumber = {1446401},
     zbl = {0889.05008},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/MB.1997.126183/}
}
TY  - JOUR
AU  - Klaška, Jiří
TI  - Transitivity and partial order
JO  - Mathematica Bohemica
PY  - 1997
SP  - 75
EP  - 82
VL  - 122
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.21136/MB.1997.126183/
DO  - 10.21136/MB.1997.126183
LA  - en
ID  - 10_21136_MB_1997_126183
ER  - 
%0 Journal Article
%A Klaška, Jiří
%T Transitivity and partial order
%J Mathematica Bohemica
%D 1997
%P 75-82
%V 122
%N 1
%U http://geodesic.mathdoc.fr/articles/10.21136/MB.1997.126183/
%R 10.21136/MB.1997.126183
%G en
%F 10_21136_MB_1997_126183

[1] Z. I. Borevich: Periodicity of residues of the numbeг of finite labeled $T_0$-topologies. Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. 114 (1982), 32-36. (In Russian.) | MR

[2] Z. I. Borevich: A comparison for the number of finite labeled $T_0$-topologies. Mat. Issled. (1982), no. 65, 9-16. (In Russian.) | MR

[3] M. Erné: Struktur- und Anzahlformeln für Topologien auf endlichen Mengen. Manuscripta Math. 11 (1974), 221-259. | DOI | MR

[4] M. Erné аnd K. Stege: Counting finite posets and topologies. Order 8 (1991), no. 3, 247-265. | DOI | MR

[5] J. W. Evаns F. Hаrаry аnd M. S. Lynn: On the computer enumeration of finite topologies. Coom. ACM 10 (1967), 295-298. | DOI

[6] K. H. Kim аnd F. W. Roush: Posets and finite topologies. Pure Appl. Math. Sci. 14 (1981), no. 1-2, 9-22. | MR

[7] J. Klаškа: Partitions and partially ordered sets. Acta Math. Inform. Univ. Ostraviensis 3 (1995), 45-54. | MR

[8] D. Kleitmаn аnd B. Rothschild: Asymptotic enumeration of partial orders on a finite set. Trans. Amer. Math. Soc. 205 (1975), 205-220. | DOI | MR

[9] V. Novák аnd M. Novotný: Transitive ternary relations and quasiorderings. Arch. Math. (Brno) 25 (1989), no. 1-2, 5-12. | MR

[10] V. Novák аnd M. Novotný: Binaгy and teгnary relations. Math. Bohem. 117 (1992), no. 3, 283-292.

Cité par Sources :