Abstract
Let N( n, k) be the minimum number of pairwise edge disjoint monochromatic complete graphs K k in any 2-coloring of the edges of a K n . Upper and lower bounds on N( n, k) will be given for k⩾3. For k=3, exact values will be given for n⩽11, and these will be used to give a lower bound for N( n,3).
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.
