Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

A problem I am looking at for my research inspired this problem.

Given a bipartite graph $G=(U,V,E)$, find $\max k$ such that there exists a $k$-coloring on V, $f:V \rightarrow \{1,2,\ldots,k\}$ which satisfies $\cup_{v\in \mathcal{N}(u)} f(v)=\{1,2,\ldots,k\}$, i.e. what is the maximum number of colors that can be assigned to vertices in $V$, such that all vertices in $U$ have all colors as neighbors?

share|cite|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.