Research Projects

The study aims to study the combinatorial properties of almost intersecting families, which are subsets of [n]. The work is divided into three sections: establishing the upper bound on the size of almost intersecting families, almost intersecting k-uniform families, and establishing stability results for almost intersecting k-uniform families. The authors conjecture that establishing an upper bound on the size of almost intersecting families is not straightforward. They also propose a tight upper bound for almost intersecting k-uniform families, such as F, which is a double star and achieves the conjecture. The study also plans to study the upper bound on the size of almost intersecting k-uniform families.