Multilinear polynomials and a conjecture of Frankl and Füredi (Q1284481): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q123021944, #quickstatements; #temporary_batch_1708296850199 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q123021944 / rank | |||
Normal rank |
Revision as of 01:23, 19 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Multilinear polynomials and a conjecture of Frankl and Füredi |
scientific article |
Statements
Multilinear polynomials and a conjecture of Frankl and Füredi (English)
0 references
7 July 1999
0 references
Let \(S\) be a set of integers. A set system \(\mathcal F\) on \(\{ 1,\ldots, n\}=[n]\) is \(S\)-intersecting, if the cardinality of every pairwise intersection belongs to \(S.\) The Frankl-Füredi conjecture, which is closely related to the non-uniform Ray-Chaudhary-Wilson theorem of Frankl and Wilson, can be formulized as follows: Let a family \(\mathcal F\) on \([n]\) satisfy that every pairwise intersection has at least 1 but at most \(k\) elements. Then \[ | {\mathcal F}| \leq \sum_{i=0}^k {n-1\choose i}. \] This statement was proved first by \textit{G. V. Ramanan} [J. Comb. Theory, Ser. A 79, No. 1, 53-67, Art. No. TA962774 (1997; Zbl 0882.05120)]. This paper gives a new, simpler proof for the conjecture, using H. S. Snevily's approach.
0 references
multilinear polynomial
0 references
Ray-Chaudhury-Wilson theorem
0 references
Frankl-Wilson theorem
0 references
set system
0 references
intersection
0 references
Frankl-Füredi conjecture
0 references