Abstract
AbstractLet be a set of subsets of and be an integer. The ‐colorability defect of is the least number of elements of that need to be removed such that the remaining ground set can be ‐colored without inducing monochromatic sets in . The set is a subset of containing all elements of such that any two members of are at least at distance apart on the ‐cycle. The main purpose of this note is to give a counterexample to a conjecture raised by Florian Frick, which says if is a set of subsets of and , then the number of blocks needed to partition the elements of such that no pairwise disjoint sets lie in the same block is at least .
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.
