Regular Intersecting Families

09/29/2017
by   Ferdinand Ihringer, et al.
0

We call a family of sets intersecting, if any two sets in the family intersect. In this paper we investigate intersecting families F of k-element subsets of [n]:={1,..., n}, such that every element of [n] lies in the same (or approximately the same) number of members of F. In particular, we show that we can guarantee |F| = o(n-1 k-1) if and only if k=o(n).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/09/2021

Best possible bounds on the number of distinct differences in intersecting families

For a family ℱ, let 𝒟(ℱ) stand for the family of all sets that can be ex...
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...
research
04/12/2021

Ranking Sets of Objects: The Complexity of Avoiding Impossibility Results

The problem of lifting a preference order on a set of objects to a prefe...
research
06/15/2020

Modeling Joint Lives within Families

Family history is usually seen as a significant factor insurance compani...
research
08/24/2022

VisFCAC: An Interactive Family Clinical Attribute Comparison

This paper presents VisFCAC, a visual analysis system that displays fami...
research
06/09/2021

Uniform intersecting families with large covering number

A family ℱ has covering number τ if the size of the smallest set interse...
research
02/23/2019

Fully Automatic, Verified Classification of all Frankl-Complete (FC(6)) Set Families

The Frankl's conjecture, formulated in 1979. and still open, states that...

Please sign up or login with your details

Forgot password? Click here to reset