Abstract
Let F={F1,F2,…} be a sequence of graphs such that Fn is a graph on n vertices with maximum degree at most Δ. We show that there exists an absolute constant C such that the vertices of any 2-edge-colored complete graph can be partitioned into at most 2CΔlogΔ vertex disjoint monochromatic copies of graphs from F. If each Fn is bipartite, then we can improve this bound to 2CΔ; this result is optimal up to the constant C.
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.
