Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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|improve this question
add comment

Your Answer

 
discard

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

Browse other questions tagged or ask your own question.