Maximum hitting for \(n\) sufficiently large (Q742567): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s00373-012-1281-9 / rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1203.4188 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complete intersection theorem for systems of finite sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum hitting of a set by compressed intersecting families / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3770569 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00373-012-1281-9 / rank | |||
Normal rank | |||
Latest revision as of 02:47, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum hitting for \(n\) sufficiently large |
scientific article |
Statements
Maximum hitting for \(n\) sufficiently large (English)
0 references
19 September 2014
0 references
intersecting family
0 references
compression
0 references
generating set
0 references
Erdős-Ko-Rado theorem
0 references
