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

Simple item page
dc.creatorZaslavsky, Thomas
dc.date2006-09-01
dc.date.accessioned2026-07-07T07:24:26Z
dc.date.available2026-07-07T07:24:26Z
dc.descriptionSet-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.
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/math/0609049
dc.identifierhttp://arxiv.org/abs/math/0609049
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116349
dc.subjectCombinatorics
dc.subject05A05, 05A15, 05C15 (Primary) 05A10, 05C22 (Secondary)
dc.titleA new distribution problem of balls into urns, and how to color a graph by different-sized sets
dc.typetext

Files

Collections

arXiv