{
  "abstract": "Let $\\mathcal{H}$ be a 3-graph on $n$ vertices. The matching number $\\nu(\\mathcal{H})$ is defined as the maximum number of disjoint edges in $\\mathcal{H}$. The generalized triangle $F_5$ is a 3-graph on the vertex set $\\{a,b,c,d,e\\}$ with the edge set $\\{abc, abd,cde\\}$. In this paper, we determine the maximum number of edges in an $F_5$-free $3$-graph $\\mathcal{H}$ satisfying $\\nu(\\mathcal{H})\\leq s$ when $n\\geq 30(s+1)$. More precisely, the maximum is $\\binom{n-1}{2}$ for $s=1,2$ and is $s\\bigl\\lfloor (n-s)^2/4\\bigr\\rfloor$ for $s\\geq 3$. We also determine the unique extremal graph for each case. For the proof, we establish a 2-colored version of Mantel's theorem, which may be of independent interest.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": null,
  "author_total": 3,
  "authors": [
    {
      "name": "Jian Wang"
    },
    {
      "name": "Wenbin Wang"
    },
    {
      "name": "Weihua Yang"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/c7z0ch35n76r6.bib",
  "cited_by": 0,
  "doi": "10.37236/14444",
  "fulltext_url": null,
  "id": "c7z0ch35n76r6",
  "issns": [
    "1077-8926"
  ],
  "landing_url": "https://www.combinatorics.org/ojs/index.php/eljc/article/view/v33i4p18",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "journal",
  "licence_url": "https://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": null,
  "native_subjects": [
    [
      "openalex",
      "2607|Limits and Structures in Graph Theory"
    ]
  ],
  "openalex": "W4415347910",
  "pdf_url": "https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i4p18/pdf",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-23",
  "publisher": "The Electronic Journal of Combinatorics",
  "ris": "https://research.draconitic.com/paper/c7z0ch35n76r6.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:18:24Z",
      "native_id": "10.37236/14444",
      "source": "crossref",
      "url": "https://www.combinatorics.org/ojs/index.php/eljc/article/view/v33i4p18"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "openalex:2607|Limits and Structures in Graph Theory",
      "subfield": "combinatorics"
    }
  ],
  "title": "Hypergraph Turán Problem of the Generalized Triangle with Bounded Matching Number",
  "title_text": "Hypergraph Turán Problem of the Generalized Triangle with Bounded Matching Number",
  "type": "peer-reviewed",
  "updated_at": "2026-10-30T12:18:24Z",
  "url": "https://research.draconitic.com/paper/c7z0ch35n76r6",
  "venue": "The Electronic Journal of Combinatorics",
  "versions": []
}