*????????????? ?????

*??座????????

Chv?tal??s conjecture on the intersecting family of the faces of the simplicial complex is a long-standing problem in combinatorics. Snevily gave an affirmative answer to this conjecture for near-cone complex. Woodroofe gave Erd?s-Ko-Rado type theorem for near-cone complex by using algebraic shift method. Motivated by these results, we concerned with the restricted intersecting family for the simplicial complex and gave an upper bound for the cardinality of the restricted intersecting family of the faces of the simplicial complex. Applying our theorems to certain simplicial complex, we can deduce the upper bounds for the cardinalities of the restricted intersecting families of the independent set of the graph, the set partition, the -separated sets and the King Arthur and his Knight Table.


*?????????

?????????????ё?????????????????2010????????????????ё??????????????????????????2017???2018????????鶷exas A&M University????????????????????组????????组?????????????????????????????Trans. Amer. Math. Soc.??Math. Comp.??Pacific J. Math.??Proc. Amer. Math. Soc.??Proc. Royal. Soc. Edinb. A??Proc. Edinb. Math. Soc.??Adv. Appl. Math.?? SIAM J. Discrete Math.????????表????20???????31????????????????组??(FPSAC)??????????????