Abstract
Feder and Subi conjectured that for any 2-coloring of the edges of the n-dimensional cube, there is an antipodal pair of vertices connected by a path that changes color at most once. They proved that if the coloring is such that there are no properly edge colored 4-cycles, the conjecture is true, without a color change. We generalize their theorem by weakening the assumption on the coloring. Our method can be applied to a similar question on any graph, if the condition on the coloring is satisfied. We solve the corresponding problem on the toroidal grid of size 2a×2b.
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.
