Abstract
The t-color Ramsey problem for hypergraph matchings was settled by the well-known result of Alon, Frankl and Lovász (answering a conjecture of Erdős). This result was the last step in a chain of special cases most notably Lovász’s solution to Kneser’s problem. We proposed an extension of the Erdős problem: for given 1≤s≤t, what is the maximum number of vertices that can be covered by a matching having at most s colors in every t-coloring of the edges of the complete graph Kn (or hypergraph Knr).We revisit the first unknown case, r=2,s=2,t=4, where we conjectured that in every 4-coloring of Kn there is a bicolored matching covering at least ⌊3n∕4⌋ vertices. We prove that this is true asymptotically by applying a recent twist of a standard application of the Regularity method: instead of lifting a (bicolored) matching of the reduced graph to regular cluster pairs, we lift a (bicolored) basic 2-matching, a subgraph whose connected components are edges and odd cycles. To find the bicolored basic 2-matching with at least ⌊3n∕4⌋ vertices in every 4-coloring of Kn we use Tutte’s minimax formula.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.