Abstract
Let n,s be integers, n≥2(s+1)≥4. Let F,G⊂[n]2 be two graphs. We determine the exact maximum of |F|+|G| subject to the condition that there is no matching of size s+1 contained in F∪G and having non-empty intersection with both F and G.
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.
