An invariant for hypergraphs

DOI10.1007/BF02007730zbMath0868.05038MaRDI QIDQ2565200

Tony T. Lee, Jian-fang Wang

Publication date: 25 June 1997

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

zbMATH Keywords

Möbius functionhypergraphEuler characteristicinvariantsemilatticedata basesGraham reductionear removalintersection closureLee number

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items (7)

On the discovery of the cycle-axiom of hypergraphs ⋮ Homology cycles and dependent cycles of hypergraphs ⋮ Hamiltonian decomposition of complete bipartite \(r\)-hypergraphs ⋮ On axioms constituting the foundation of hypergraph theory ⋮ Paths and cycles of hypergraphs ⋮ Enumeration of maximum acyclic hypergraphs ⋮ Counting acyclic hypergraphs

Cites Work

• On the Desirability of Acyclic Database Schemes
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
• Unnamed Item

This page was built for publication: An invariant for hypergraphs