Abstract
Let M be a nonempty family of subsets of a finite set X. The family M is said to be weakly acyclic if there exists a tree t such that the edge set of t is X and each element of M is a set of edges of some path in t. The main purpose of this paper is to prove some decomposition, reduction and augmentation theorems for weakly acyclic families.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D.R. Fulkerson, O.A. Gross, Incidence matrices and interval graphs, J. Math., 15 (1965), 835–855.
F. Gavril, R. Tamari, An algorithm for constructing edge-trees from hypergraphs, manuscript, (1980).
F. Harary, Graph Theory, Addison-Wesley, (1969).
W. Lipski, Information storage and retrieval — Mathematical fundations II, Theoretical Comp. Sci., 3 (1976), 183–211.
J. Rajkow-Krzywicki, An application of structural numbers to information retrieval, CC PAS Reports, No. 254, Warsaw, (1976).
J. Rajkow-Krzywicki, An application of structural numbers to information retrieval, Part II, ICS PAS Reports, No. 309, Warsaw, (1978).
J. Rajkow-Krzywicki, On some classes of hypergraphs, Demonstratio Mathematica, 15 (1982), 63–72.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag
About this paper
Cite this paper
Rajkow-Krzywicki, J. (1983). Weakly acyclic families of sets: Decomposition, reduction and augmentation. In: Borowiecki, M., Kennedy, J.W., Sysło, M.M. (eds) Graph Theory. Lecture Notes in Mathematics, vol 1018. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0071629
Download citation
DOI: https://doi.org/10.1007/BFb0071629
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12687-4
Online ISBN: 978-3-540-38679-7
eBook Packages: Springer Book Archive