Abstract
For fixed k≥2, determining the order of magnitude of the number of edges in an n-vertex bipartite graph not containing C2k, the cycle of length 2k, is a long-standing open problem. We consider an extension of this problem to triple systems. In particular, we prove that the maximum number of triples in an n-vertex triple system which does not contain a C6 in the link of any vertex, has order of magnitude n7/3. Additionally, we construct new families of dense C6-free bipartite graphs with n vertices and n4/3 edges in order of magnitude.
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.
