Intersecting designs from linear programming and graphs of diameter two (Q1322228)
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: Intersecting designs from linear programming and graphs of diameter two |
scientific article; zbMATH DE number 562630
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Intersecting designs from linear programming and graphs of diameter two |
scientific article; zbMATH DE number 562630 |
Statements
Intersecting designs from linear programming and graphs of diameter two (English)
0 references
5 May 1994
0 references
This paper surveys some extremal problems whose solutions naturally lead to linear programming on an intersecting hypergraph, and obtains designs as solutions of extremal problems in hypergraph theory. In this way the author proposes several problems and conjectures for further research.
0 references
intersecting designs
0 references
diameter
0 references
extremal problems
0 references
linear programming
0 references
intersecting hypergraph
0 references
designs
0 references
