Additive induced-hereditary properties and unique factorization
From MaRDI portal
Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62) Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Graphs, diagram schemes, precategories (18A10) Groupoids (i.e. small categories in which all morphisms are isomorphisms) (20L05)
Abstract: We show that additive induced-hereditary properties of coloured hypergraphs can be uniquely factorised into irreducible factors. Our constructions and proofs are so general that they can be used for arbitrary concrete categories of combinatorial objects; we provide some examples of such combinatorial objects.
This page was built for publication: Additive induced-hereditary properties and unique factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6472915)
