Abstract
Given a pure simplicial complex C of dimension d-1, assign a subset of {1,...,d} to each vertex, in such a way that each maximal face has all d colors. What is the minimum total number NC(C) of color assignments needed? The number of vertices is a lower bound on NC(C), which is attained if and only if the simplicial complex is completely balanced. Thus for any given pure simplicial complex, we have a measure of the extent to which it fails to be completely balanced. We obtain complete solutions for NC(C) in the case where C has four or less facets.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
