Additive induced-hereditary properties and unique factorization

Simple item page
dc.creatorArkit, Grzegorz
dc.creatorFarrugia, Alastair
dc.creatorMihók, Peter
dc.creatorSemanišin, Gabriel
dc.creatorVasky, Roman
dc.date2003-06-10
dc.date.accessioned2026-07-07T04:58:43Z
dc.date.available2026-07-07T04:58:43Z
dc.descriptionWe 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.
dc.description16 pages, 4 figures, submitted to Combinatorica
dc.identifierhttps://arxiv.org/abs/math/0306166
dc.identifierhttp://arxiv.org/abs/math/0306166
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/67755
dc.subjectCombinatorics
dc.subject05C15 (Primary), 05C62, 05C65, 05C75, 18A10, 20L05 (Secondary)
dc.titleAdditive induced-hereditary properties and unique factorization
dc.typetext

Files

Collections

arXiv