Maximum hitting for \(n\) sufficiently large (Q742567): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 01:12, 9 July 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
