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

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

2006-09-01

arxiv.org/abs/math/0609049v1

Mathematics

Combinatorics

6 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A new distribution problem of balls into urns, and how to color a graph by different-sized sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A new distribution problem of balls into urns, and how to color a graph by different-sized sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new distribution problem of balls into urns, and how to color a graph by different-sized sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-109772