On the Cardinality of Relations
This paper will discuss and characterise the cardinality of boolean (crisp) and fuzzy relations. The main result is a Dedekind inequality for the cardinality, which enables us to manipulate the cardinality of the composites of relations. As applications a few relational proofs for the basic theorems on graph matchings, and fundamentals about network flows will be given.
KeywordsDistinct Element Transitive Closure Fuzzy Relation Graph Matchings Univalent Relation
Unable to display preview. Download preview PDF.
- 1.Diestel, R.: Graph theory, Graduate texts in mathematics, 3rd edn., vol. 173. Springer, Berlin (2005)Google Scholar
- 2.Freyd, P., Scedrov, A.: Categories, allegories, North-Holland, Amsterdam (1990)Google Scholar
- 4.Schmidt, G., Ströhlein, T.: Relations and graphs – Discrete Mathematics for Computer Science. Springer-Verlag, Berlin (1993)Google Scholar
- 5.Tarski, A.: Some metalogical results concerning the calculus of relations. Journal of Symbolic Logic 18(2), 188–189 (1953)Google Scholar