شماره ركورد كنفرانس
5263
عنوان مقاله
A general framework for Erdös-Ko-Rado type problems
پديدآورندگان
EBRAHRIMI BOROOJENI JAVAD javad.ebrahimi@sharif.ir Department of Mathematical Sciences, Sharif University of Technology and IPM - Institute for Research in Fundamental Sciences, Tehran, Iran. , Taherkhani Ali ali.taherkhani@iasbs.ac.ir Department of Mathematics, Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan, Iran
تعداد صفحه
4
كليدواژه
extremal combinatorics , Erdös , Ko , Rado Theorem , intersecting families
سال انتشار
1402
عنوان كنفرانس
54 امين كنفرانس رياضي ايران
زبان مدرك
انگليسي
چكيده فارسي
The famous Erdős-Ko-Rado theorem (EKR) states that when 2k n are positive integers, the largest family of pair_x0002_wise intersecting k-subsets of an n-set is when all the subsets share one specific element. Many different generalization of this theorem has been discovered. In this work, we propose a novel approach to prove EKR Theorem as well as some of its generalizations and related extremal combinatorics problems.
كشور
ايران
لينک به اين مدرک