A new distribution problem of balls into urns, and how to color a graph by different-sized sets
classification
🧮 math.CO
keywords
graphcolordistributionproblemadjacentballscardinalitycomplete
read the original abstract
Set-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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.