The maximum size of 3-wise \(t\)-intersecting families (Q854817)
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: The maximum size of 3-wise t-intersecting families |
scientific article; zbMATH DE number 5077696
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum size of 3-wise \(t\)-intersecting families |
scientific article; zbMATH DE number 5077696 |
Statements
The maximum size of 3-wise \(t\)-intersecting families (English)
0 references
7 December 2006
0 references
This paper proves a new analogous result of the Erdős-Ko-Rado theorem for 3-wise \(t\)-intersecting families where \(t\) is at least 26. The proof is similar to those originated by Frankl dealing with the original 2-wise \(t\)-intersecting problem, using the shifting operations and a random walk technique.
0 references
Erdős-Ko-Rado theorem
0 references
shifting technique
0 references
random walk
0 references
0.8412162661552429
0 references
0.8315010070800781
0 references
0.8287761211395264
0 references
0.8213661909103394
0 references
0.8165645003318787
0 references
