Abstract
Motivated by the Erdős–Szekeres convex polytope conjecture in , we initiate the study of the following induced Ramsey problem for hypergraphs. Given integers , what is the minimum integer such that any -uniform hypergraph on vertices with the property that any set of vertices induces 0, 2, or 4 edges, contains an independent set of size . Our main result shows that , where .
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.
