On axioms constituting the foundation of hypergraph theory
From MaRDI portal
Publication:2508044
This paper studies the different definitions of acyclic hypergraphs used in database theory. It introduces a new definition of cycle in hypergraphs and shows that those two notions are in good agreement.
Recommendations
Cites work
- An invariant for hypergraphs
- Counting acyclic hypergraphs
- Enumeration of maximum acyclic hypergraphs
- scientific article; zbMATH DE number 3890770 (Why is no real title available?)
- scientific article; zbMATH DE number 863476 (Why is no real title available?)
- On acyclic and cyclic hypergraphs
- On rigid circuit graphs
- On the Desirability of Acyclic Database Schemes
- Paths and cycles of hypergraphs
Cited in
(14)- On the notion of cycles in hypergraphs
- On hypergraph acyclicity and graph chordality
- Studies on hypergraphs. I: Hyperforests
- Homology cycles and dependent cycles of hypergraphs
- On acyclic and cyclic hypergraphs
- The Ryōan-ji axiom for common knowledge on hypergraphs
- Standardized algorithm of relation scheme for hypergraph database
- The -arboricity of complete uniform hypergraphs
- scientific article; zbMATH DE number 859448 (Why is no real title available?)
- On a note of cycle-axiom of hypergraphs
- Axiomatization and Core Stability of Allocation Rules for Hypergraph Situations
- On the discovery of the cycle-axiom of hypergraphs
- Connections in acyclic hypergraphs
- Arboricity: an acyclic hypergraph decomposition problem motivated by database theory
This page was built for publication: On axioms constituting the foundation of hypergraph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2508044)
