Maximum hitting for \(n\) sufficiently large (Q742567)
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: Maximum hitting for n sufficiently large |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9027235507965088
0 references
0.8215273022651672
0 references
0.8157447576522827
0 references
0.8027974367141724
0 references
0.8007627129554749
0 references
