New inequalities for families without k pairwise disjoint members

04/10/2018
by   Peter Frankl, et al.
0

Some best possible inequalities are established for k-partition-free families (cf. Definition 1) and they are applied to prove a sharpening of a classical result of Kleitman concerning families without k pairwise disjoint members.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/16/2021

The number of tangencies between two families of curves

We prove that the number of tangencies between the members of two famili...
research
05/20/2019

Sharp results concerning disjoint cross-intersecting families

For an $n$-element set $X$ let $\binom{X}{k}$ be the collection of all i...
research
08/11/2019

Linking of three triangles in 3-space

Two triples of pairwise disjoint triangles in 3-space are combinatoriall...
research
12/12/2018

The Crossing Tverberg Theorem

Tverberg's theorem is one of the cornerstones of discrete geometry. It s...
research
11/26/2020

Disjoint Stable Matchings in Linear Time

We show that given a SM instance G as input we can find a largest collec...
research
08/21/2017

Arrangements of Pseudocircles: Triangles and Drawings

A pseudocircle is a simple closed curve on the sphere or in the plane. T...
research
05/02/2023

The Family Tree Graph as a Predictor of the Family Members' Satisfaction with One Another

Individuals' satisfaction with their nuclear and extended family plays a...

Please sign up or login with your details

Forgot password? Click here to reset