Abstract
Let be a connected, non-complete bipartite graph with . An independent set of is said to be trivial if or . Otherwise, is nontrivial. By we denote the size of maximal-sized nontrivial independent sets of . We prove that if the automorphism group of is transitive on and , then , where is the common degree of vertices in . We also give the structures of maximal-sized nontrivial independent sets of . As applications of this result, we give the upper bound of sizes of two cross--intersecting families of finite sets, finite vector spaces and permutations.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.