Asymptotic growth of sparse saturated structures is locally determined (Q1201274): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: An extremal problem for sets with applications to graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On generalized graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3852212 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Saturated \(r\)-uniform hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Problem in Graph Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Saturated graphs with minimal number of edges / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Asymptotic results on saturated graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3812267 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5750884 / rank | |||
Normal rank |
Latest revision as of 13:03, 17 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Asymptotic growth of sparse saturated structures is locally determined |
scientific article |
Statements
Asymptotic growth of sparse saturated structures is locally determined (English)
0 references
17 January 1993
0 references
Let \(F\) be an \(r\)-uniform hypergraph without multiple edges. Let \[ d(F)=\min_{f\in F}\left\{\max_{e\in F,e\neq f}\{| e\cap f|\}\right\} \] be the local density of \(F\). It is shown that \(d(F)\) determines the growth of \(\text{wsat}(n,F)\) --- the minimum number of edges in a weakly \(F\)-saturated hypergraph on \(n\) vertices. Another value --- local sparseness --- determines the growth \(\text{ssat}(n,F)\) for strongly \(F\)-saturated hypergraphs.
0 references
growth
0 references
Turán number
0 references
hypergraph
0 references
local density
0 references
local sparseness
0 references