Abstract
A hypergraph-property P is supra-hereditary if whenever a hypergraph H has property P and K is a hypergraph generated by a nonempty subset A of X(H), then K also has the property P. In this paper we give a characterization of irreducible supra-hereditary hypergraphs thereby doubly extending a similar result in graph theory. Hence, we raise some fundamental questions in hypergraph theory.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Acharya, B.D.: Separability and acyclicity in hypergraphs. In: Rao, A.R. (ed.) Proceedings of the Symposium on Graph Theory, ISI Lecture Notes No. 4 , pp. 65–83. The Macmillan Company India Ltd., Calcutta (1979)
Berge C.: Graphs and hypergraphs. North Holland, Amsterdam (1973)
Berge C.: Hypergraphs. North Holland, Amsterdam (1989)
Harary F.: Graph theory. Addison Wesley, Reading (1969)
Rao S.B.: Towards a theory of forcibly hereditary P-graphic sequences. In: Rao, S.B. (ed.) Combinatorics and graph theory, lecture notes in computer science, vol. 885, pp. 441–458. Springer, Berlin (1981)
Usha Devi N., Vijayakumar G.R.: Hereditary properties of graphs. Disc. Math. 206, 213–215 (1999)
West D.B.: Introduction to graph theory. Prentice-Hall of India Private Limited, New Delhi (1996)
Woodall D.R.: A note on rank functions and integer programming. Disc. Math. 17, 215–218 (1977)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Acharya, B.D. Supra-Hereditary Properties of Hypergraphs. Math.Comput.Sci. 5, 3–6 (2011). https://doi.org/10.1007/s11786-011-0072-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11786-011-0072-7