Nontrivial independent sets of bipartite graphs and cross-intersecting families

Authors:
Jun Wang;Huajun Zhang
Affiliations:
Department of Mathematics, Shanghai Normal University, Shanghai 200234, PR China;Department of Mathematics, Zhejiang Normal University, Jinhua 321004, PR China
Venue:
Journal of Combinatorial Theory Series A
Year:
2013

Citing 11
Cited 0

The Erdo¨s-Ko-Rado theorem for vector spaces

Journal of Combinatorial Theory Series A
q-Analogs of the inclusion-exclusion principle and permutations with restricted position

Discrete Mathematics
Some best possible inequalities concerning cross-intersecting families

Journal of Combinatorial Theory Series A
Intersecting families of permutations

European Journal of Combinatorics
Stable sets of maximal size in Kneser-type graphs

European Journal of Combinatorics
An Erdős-Ko-Rado-type theorem in Coxeter groups

European Journal of Combinatorics
A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations

European Journal of Combinatorics
Eigenvalues of the derangement graph

Journal of Combinatorial Theory Series A
Note: Cross-intersecting families of permutations

Journal of Combinatorial Theory Series A
Note: Multiple cross-intersecting families of signed sets

Journal of Combinatorial Theory Series A
Cross-intersecting families and primitivity of symmetric systems

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let G(X,Y) be a connected, non-complete bipartite graph with |X|=