Abstract
Motivated by the problem in (Tveretina et al., 2009) [8], which studies problems from propositional proof complexity, 2-edge colorings of complete bipartite graphs are investigated. It is shown that if the edges of G=Kn,n are colored with black and white such that the number of black edges differs from the number of white edges by at most 1, then there are at least n(1−1/2) vertex-disjoint forks with centers in the same partite set of G. Here, a fork is a graph formed by two adjacent edges of different colors. The bound is sharp. Moreover, an algorithm running in time O(n2lognnα(n2,n)logn) and giving a largest such fork forest is found.
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.
