Abstract
Hypergraphs are the most general structures in discrete mathematics. Acyclic hypergraphs have been proved very useful in relational databases. New systems of axioms for paths, connectivity and cycles of hypergraphs are constructed. The systems suit the structure properties of relational databases. The concepts of pseudo cycles and essential cycles of hypergraphs are introduced. They are relative to each other. Whether a family of cycles of a hypergraph is dependent or independent is defined. An enumeration formula for the maximum number of independent essential cycles of a hypergraph is given.
Similar content being viewed by others
References
Aigner, M.,Combinatorial Theory, New York: Springer-Verlag, 1979.
Maier, D.,The Theory of Relational Databases, Rockvile: Computer Science Press, Inc., 1983.
Beeri, C., Fagin, R., Maier, D., Yannakakis, M., On the desirability of acyclic database schemes, JACM, 1983, 30: 479.
Lee, T. T., An information-theoretic analysis of relational databases-part 2: information structures of database schemes,IEEE Trans. Softw. Eng., 1987, SE-13: 1062.
Lee, T. T., The Euler formula of cyclomatic number of hypergraphs,Southeastern Asian Bulletin of Mathematics, 1997, 21: 113.
Wang, J. F., Lee, T. T., An invariant for hypergraphs,Chinese Acta Mathematicae Applicatae Sinica, 1996, 2(2): 113.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wang, J., Lee, T.T. Paths and cycles of hypergraphs. Sci. China Ser. A-Math. 42, 1–12 (1999). https://doi.org/10.1007/BF02872044
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02872044