𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Multilinear Polynomials and a Conjecture of Frankl and Füredi

✍ Scribed by Arvind Sankar; Sundar Vishwanathan


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
86 KB
Volume
86
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

✦ Synopsis


Frankl and Fu redi conjectured that given a family F of subsets of [n] such that 1 |E & F| k for all distinct E and F in F, we must have |F| k i=0 ( n&1 i


📜 SIMILAR VOLUMES


Proof of a Conjecture of Frankl and Füre
✍ Gurumurthi V. Ramanan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 375 KB

We give a simple linear algebraic proof of the following conjecture of Frankl and Fu redi [7,9,13]. (Frankl We generalise a method of Palisse and our proof-technique can be viewed as a variant of the technique used by Tverberg to prove a result of Graham and Pollak [10,11,14]. Our proof-technique

A conjecture of Borodin and a coloring o
✍ Dieter Rautenbach 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB

## Abstract In 1976, Borodin conjectured that every planar graph has a 5‐coloring such that the union of every __k__ color classes with 1 ≤ __k__ ≤ 4 induces a (__k__—1)‐degenerate graph. We prove the existence of such a coloring using 18 colors. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:139

Covers in Uniform Intersecting Families
✍ Peter Frankl; Katsuhiro Ota; Norihide Tokushige 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 446 KB

We discuss the maximum size of uniform intersecting families with covering number at least {. Among others, we construct a large k-uniform intersecting family with covering number k, which provides a counterexample to a conjecture of Lova sz. The construction for odd k can be visualized on an annulu

On a conjecture of Thomassen and Toft
✍ Kriesell, Matthias 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB 👁 2 views

This article is motivated by a conjecture of Thomassen and Toft on the number s 2 (G) of separating vertex sets of cardinality 2 and the number v 2 (G) of vertices of degree 2 in a graph G belonging to the class G of all 2-connected graphs without nonseparating induced cycles. Let G denote the numbe