Maximal \(\tau\)-critical linear hypergraphs (Q5936093)
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: Maximal \(\tau\)-critical linear hypergraphs |
scientific article; zbMATH DE number 1612987
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximal \(\tau\)-critical linear hypergraphs |
scientific article; zbMATH DE number 1612987 |
Statements
Maximal \(\tau\)-critical linear hypergraphs (English)
0 references
25 February 2002
0 references
Hypergraph \(H\) is linear, if its any two edges have at most one point in common. A point set \(T\) is a cover if it intersects every edge. The minimum cardinality \(\tau(H)\) of a cover is the covering number. A hypergraph is \(\tau\)-critical if the deletion of any edge decreases its covering number. This paper, using finite affine geometries, gives a (constructive) lower bound for the maximum size of \(\tau\)-critical linear hypergraphs.
0 references
linear hypergraph
0 references
finite affine geometries
0 references
\(\tau\)-critical hypergraph
0 references
covering number
0 references
