PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
April 5, 2024The Electronic Journal of Combinatorics3 citationsOpen Access

A 2-Stable Family of Triple Systems

View Full Paper
YZYixiao ZhangJHJianfeng HouHLHeng Li

Key Points

Key points are not available for this paper at this time.

Abstract

For many well-known families of triple systems M, there are perhaps many near-extremal M-free configurations that are far from each other in edit-distance. Such a property is called non-stable and is a fundamental barrier to determining the Turán number of M. Liu and Mubayi gave the first finite example that is non-stable. In this paper, we construct another finite family of triple systems M such that there are two near-extremal M-free configurations that are far from each other in edit-distance. We also prove its Andrásfai-Erdős-Sós type stability theorem: Every M-free triple system whose minimum degree is close to the average degree of the extremal configurations is a subgraph of one of these two near-extremal configurations. As a corollary, our main result shows that the boundary of the feasible region of M has exactly two global maxima.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Zhang et al. (2024) studied this question.

synapsesocial.com/papers/68e70336b6db64358767da9chttps://doi.org/10.37236/11701
Ask AI
Helpful
Bookmark
Share
View Full Paper