Linear saturation numbers of Berge-C3 and Berge-C4

Changxin Wang and Junxue Zhang

Applied Mathematics and Computation, 2024, vol. 474, issue C

Abstract: The linear saturation number satklin(n,F) (linear extremal number exklin(n,F)) of F is the minimum (maximum) number of hyperedges of an n-vertex linear k-uniform hypergraph containing no member of F as a subgraph, but the addition of any new hyperedge such that the result hypergraph is still a linear k-uniform hypergraph creates a copy of some hypergraph in F. Determining ex3lin(n, Berge-C3) is equivalent to the famous (6,3)-problem, which has been settled in 1976. Since then, determining the linear extremal numbers of Berge cycles was extensively studied. As the counterpart of this problem in saturation problems, the problem of determining the linear saturation numbers of Berge cycles is considered. In this paper, we prove that satklin(n, Berge-Ct)≥⌊n−1k−1⌋ for any integers k≥3, t≥3, and the equality holds if t=3. In addition, we provide an upper bound for sat3lin(n, Berge-C4) and for any disconnected Berge-C4-saturated linear 3-uniform hypergraph, we give a lower bound for the number of hyperedges of it.

Keywords: Saturation numbers; Berge cycles; Linear hypergraphs (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324001577
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:474:y:2024:i:c:s0096300324001577

DOI: 10.1016/j.amc.2024.128685

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().