Partitioning all k-subsets into r-wise intersecting families

07/27/2021
by   Noga Alon, et al.
0

Let r ≥ 2, n and k be integers satisfying k ≤r-1/rn. In the original arXiv version of this note we suggested a conjecture that the family of all k-subsets of an n-set cannot be partitioned into fewer than ⌈ n-r/r-1(k-1) ⌉ r-wise intersecting families. We noted that if true this is tight for all values of the parameters, that the case r=2 is Kneser's conjecture, proved by Lovász, and observed that the assertion also holds provided r is either a prime number or a power of 2. We have recently learned, however, that the assertion of the conjecture for all values of the parameters follows from a recent result of Azarpendar and Jafari <cit.>.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/18/2020

Almost intersecting families

Let n > k > 1 be integers, [n] = {1, …, n}. Let ℱ be a family of k-subse...
research
09/29/2019

r-wise fractional L-intersecting family

Let L = {a_1/b_1, ... , a_s/b_s}, where for every i ∈ [s], a_i/b_i∈ [0,1...
research
12/02/2019

Idealness of k-wise intersecting families

A clutter is k-wise intersecting if every k members have a common elemen...
research
02/04/2023

The Scholz conjecture for n=2^m(23)+7, m ∈ℕ^*

The Scholz conjecture on addition chains states that ℓ(2^n-1) ≤ℓ(n) + n ...
research
03/29/2019

Ham-Sandwich cuts and center transversals in subspaces

The Ham-Sandwich theorem is a well-known result in geometry. It states t...
research
10/01/2018

Degree versions of theorems on intersecting families via stability

The matching number of a family of subsets of an n-element set is the ma...
research
09/10/2022

Octopuses in the Boolean cube: families with pairwise small intersections, part I

Let ℱ_1, …, ℱ_ℓ be families of subsets of {1, …, n}. Suppose that for di...

Please sign up or login with your details

Forgot password? Click here to reset