论文信息 - Types of Cycles in Hypergraphs

Types of Cycles in Hypergraphs

We survey some of the meanings which have been attached to word “cycle” in hypergraph theory. Besides the well-known definition due to Berge, and some recent variations of it, we consider several definitions arising when properties of cycles in graphs are taken as a starting point.

Richard A. Duke

[1] Catriel Beeri,et al. On the Desirability of Acyclic Database Schemes , 1983, JACM.

[2] Carlo Zaniolo,et al. Analysis and design of relational schemata for database systems. , 1976 .

[3] D. M. Silberger. Uniformly Deep Families of k-Membered Subsets of n , 1977, J. Comb. Theory, Ser. A.

[4] Mihalis Yannakakis,et al. Testing the Universal Instance Assumption , 1980, Inf. Process. Lett..

[5] László Lovász. Matroids and Sperner's Lemma , 1980, Eur. J. Comb..

[6] Ronald Fagin,et al. Degrees of acyclicity for hypergraphs and relational database schemes , 1983, JACM.

[7] P. Hansen,et al. On a property of hypergraphs with no cycles of length greater than two , 1974 .

[8] Bernt Lindström. On Matroids and Sperner's Lemma , 1981, Eur. J. Comb..

[9] Peter Winkler. On connectivity of triangulations of manifolds , 1980, Discret. Math..