Date of Publication:2013-01-01 Hits:
Date of Publication:2013-01-01
Journal:Journal of Combinatorial Theory. Series A
Affiliation of Author(s):数理与信息工程学院
Document Type:期刊
Volume:Vol.120
Issue:No.1
Page Number: 129-141
ISSN No.:0097-3165
Key Words:Intersecting;family;Cross-intersecting;family;Symmetric;system;Erdős–Ko–Rado;theorem
Abstract:Let G(X,Y) be a connected, non-complete bipartite graph with |X|⩽|Y|. An independent set A of G(X,Y) is said to be trivial if A⊆X or A⊆Y. Otherwise, A is nontrivial. By α(X,Y) we denote the maximum size of nontrivial independent sets of G(X,Y). We prove t
Translation or Not:no