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.
Source
Source
Science and Engineering Research Board (SERB), DST
Science and Engineering Research Board (SERB), New Delhi
Anusandhan National Research Foundation (ANRF)
Quick Information
Area of Research
Mathematical Sciences
Focus Area
Families of Sets
Start Year
2024
End Year
2027
Sanction Amount
₹ 6.60 L
Status
Ongoing
Contact
mishrat@nitrkl.ac.in
Output
No. of Research Paper
00
Technologies (If Any)
00
No. of PhD Produced
00
No. of Patents
Filed :00
Grant :00
Disclaimer:
Information available on this portal is sourced from various organizations and is provided for informational purposes only. Users are advised to verify details from the respective official sources.
Please enter your details
Please provide your name and email to continue. Your details are saved in this browser for future use.
Latest Updates
Loading…
⚠️
You are leaving this website
You are about to be redirected to an external website that is not operated by
India Science, Technology & Innovation (ISTI) Portal.
NIT, Rourkela, Odisha
Acces sibility Controls