Packing in generalized kernel systems: a framework that generalizes packing of branchings (Q2515040)

This article studies packing problems in the context of the generalized kernel system framework. The authors begin with an introduction to kernels and kernel systems and provide an overview of the literature and the necessary background definitions. The important properties of kernel systems and examples are then presented in the second section. In the third section, the authors present a generalization of the existing algorithms which is further expanded in the fourth section with the introduction of the notion of a mixed family. The use of the framework in packing problems is studied in the fifth section. The sixth section introduces an additional axiom which produces a new framework of uncrossing generalized kernel systems for which a large number of useful theorems and properties are presented with proof, including their applicability for packing problems.