A new distribution problem of balls into urns, and how to color a graph by different-sized sets

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/116349Set-coloring a graph means giving each vertex a subset of a fixed color set so that no two adjacent subsets have the same cardinality. When the graph is complete one gets a new distribution problem with an interesting generating function. We explore examples and generalizations.6 pagesCombinatorics05A05, 05A15, 05C15 (Primary) 05A10, 05C22 (Secondary)A new distribution problem of balls into urns, and how to color a graph by different-sized setstext