The Linear Turán Numbers of Acyclic Linear 4-graphs

Lin Peng Zhang, Li Gong Wang

Research output: Contribution to journalArticlepeer-review

Abstract

An r-graph G is called linear if every pair of vertices in G is contained in at most one edge. Let F and H be two linear r-graphs on n vertices. Then H is called F-free if it does not contain any copy of F as a subhypergraph. The linear Turán number exrlin(n, F) of F is the maximum number of edges in any F-free linear r-graph on n vertices. A linear r-graph is acyclic if it can be constructed starting from one single edge then at each step adding a new edge that intersect the union of the vertices of the previous edges in at most one vertex. Recently, Gyárfás et al. initiated the study of the linear Turán numbers of acyclic linear 3-graphs. In this paper, we extend their results to acyclic linear 4-graphs.

Original languageEnglish
JournalActa Mathematicae Applicatae Sinica
DOIs
StateAccepted/In press - 2025

Keywords

  • 05C05
  • 05C35
  • 05C65
  • acyclic linear hypergraph
  • linear Turán number
  • Steiner system S(2, 4, n)

Fingerprint

Dive into the research topics of 'The Linear Turán Numbers of Acyclic Linear 4-graphs'. Together they form a unique fingerprint.

Cite this