PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 3, 2026Discrete Mathematics0 citationsOpen Access

An Andrásfai–Erdős–Sós type theorem for F3,3 in the ℓ2-norm

View Full Paper
YZYixiao ZhangJHJianfeng Hou

Key Points

  • Bipartiteness is guaranteed for F3,3-free hypergraphs with sufficient vertices and degree.
  • For large n, maintaining a minimum ℓ2-norm degree of at least (5/4 - ξ)n3 is critical.
  • Stability theorems provide insights into the structure of hypergraphs with specific properties.
  • The findings enhance previous results related to hypergraph stability and structure.

Abstract

Let F 3, 3 be the 3-uniform hypergraph on six vertices with edge set 123, 145, 146, 156, 245, 246, 256, 345, 346, 356. In this note, we establish an Andrásfai–Erdős–Sós type stability theorem for F 3, 3 in the ℓ 2 -norm: There exists a positive constant ξ such that for all sufficiently large n, every F 3, 3 -free 3-uniform hypergraph on n vertices with minimum ℓ 2 -norm degree at least (5 / 4 − ξ) n 3 must be bipartite. This strengthens a result of Balogh, Clemen, and Lidický 3.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Zhang et al. (2026) studied this question.

synapsesocial.com/papers/69a7663fbadf0bb9e87dc4cfhttps://doi.org/10.1016/j.disc.2026.115022
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1On the connection between chromatic number, maximal clique and minimal degree of a graph1974 · 205 citations
  2. 2A unified approach to hypergraph stability2022 · 15 citations
  3. 3The Turán Number ofF3,32011 · 9 citations
  4. 4Triple Systems Not Containing a Fano Configuration2005 · 84 citations
  5. 5The Exact Turán Number of $F(3,3)$ and All Extremal Configurations2013 · 4 citations