Abstract
The notion of hypergraph cyclicity is crucial in numerous fields of application of hypergraph theory (e.g. in computer science, in relational database theory and constraint programming). Surprisingly, while this notion has been well studied during last thirty years, no relevant definition of cycles in hypergraphs has been proposed by the community. In this paper, we propose a definition of cycles in hypergraphs, α -cycle based on the same principle in graph theory, meaning that a hypergraph is acyclic iff it does not contain an α -cycle. This result completes the theory of the mostly used notion of hypergraph acyclicity, the α -acyclicity.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
