On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs (Q1123216)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4108826
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs |
scientific article; zbMATH DE number 4108826 |
Statements
On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs (English)
0 references
1987
0 references
The author proves that the maximal number of edges of a 4-uniform hypergraph with n vertices without two edges whose symmetric difference is contained in a third is equal to \(\lfloor n/4\rfloor \lfloor (n+1)/4\rfloor \lfloor (n+2)/4\rfloor \lfloor (n+3)/4\rfloor\) and that the extremal hypergraph is unique up to isomorphism. This settles a conjecture of \textit{B. Bollobás}, who solved the corresponding problem for 3-uniform hypergraphs [Discrete Math. 8, 21-24 (1974; Zbl 0291.05114)].
0 references
maximal number of edges
0 references
extremal hypergraph
0 references
0 references
0.8392332196235657
0 references
0.8369359374046326
0 references
0.8230082392692566
0 references
0.8189566135406494
0 references
