On hypergraphs with every four points spanning at most two triples (Q1408551)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On hypergraphs with every four points spanning at most two triples |
scientific article; zbMATH DE number 1985385
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On hypergraphs with every four points spanning at most two triples |
scientific article; zbMATH DE number 1985385 |
Statements
On hypergraphs with every four points spanning at most two triples (English)
0 references
24 September 2003
0 references
Summary: Let \(\mathcal F\) be a triple system on an \(n\)-element set. Suppose that \(\mathcal F\) contains more than \((1/3-\varepsilon)\left ( \begin{smallmatrix} n \\ 3 \end{smallmatrix}\right) \) triples, where \(\varepsilon > 10^{-6}\) is explicitly defined and \(n\) is sufficiently large. Then there is a set of four points containing at least three triples of \(\mathcal F\). This improves previous bounds of \textit{D. de Caen} [Ars Comb. 16, 5-10 (1983; Zbl 0532.05037)] and \textit{U. Matthias} [Hypergraphs without complete \(r\)-partite subgraphs (German) (Heidelberg: Univ., Naturwiss.-Mathemat. Gesamtfak.) (1994; Zbl 0818.05048)].
0 references
0.8859931
0 references
0.87936366
0 references
0.8660541
0 references
0.8640387
0 references
0 references
0.85820615
0 references
0.8522667
0 references
0.85226667
0 references
