A hypergraph extension of the bipartite Turán problem (Q1826942)
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: A hypergraph extension of the bipartite Turán problem |
scientific article; zbMATH DE number 2082021
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hypergraph extension of the bipartite Turán problem |
scientific article; zbMATH DE number 2082021 |
Statements
A hypergraph extension of the bipartite Turán problem (English)
0 references
6 August 2004
0 references
This nice paper studies excluded configuration problems on hypergraphs and proves, among others, a new upper bound \(3{n\choose 2} +6n\) on the bipartite Turán hypergraph problem which improves the previously known best result (due to \textit{Z. Füredi} [Combinatorica 4, 161--168 (1984; Zbl 0555.05006)]).
0 references
triple system
0 references
\(r\)-graph, Steiner system
0 references
bipartite Turán problem
0 references
