𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Transitivity on sets of independent points in geometric lattices

✍ Scribed by Anne Delandtsheer

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
177 KB
Volume
61
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The set of neighbours of a set in a poin
The set of neighbours of a set in a point-lattice
✍ B. Uhrin πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 454 KB

## Given an n-dimensional point-lattice A c [w" and a bounded set A c KY, the set S(A) of nonzero lattice points ueA such that A n (A + u) # f~ is called the set of neighbours of A in ,4. In the paper a disjoint decomposition of S(A) is showed which gives a representation of the cardinality N(A) o

Primitivity and independent sets in dire
Primitivity and independent sets in direct products of vertex-transitive graphs
✍ Huajun Zhang πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 92 KB

We introduce the concept of the primitivity of independent set in vertex-transitive graphs, and investigate the relationship between the primitivity and the structure of maximum independent sets in direct products of vertex-transitive graphs. As a consequence of our main results, we positively solve

Independent sets of maximal size in tens
Independent sets of maximal size in tensor powers of vertex-transitive graphs
✍ Cheng Yeaw Ku; Benjamin B. McMillan πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 97 KB πŸ‘ 2 views

## Abstract Let __G__ be a connected, nonbipartite vertex‐transitive graph. We prove that if the only independent sets of maximal cardinality in the tensor product __G__ Γ— __G__ are the preimages of the independent sets of maximal cardinality in __G__ under projections, then the same holds for all

Constraints on the number of maximal ind
Constraints on the number of maximal independent sets in graphs
✍ Jiuqiang Liu πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 387 KB πŸ‘ 2 views

## Abstract A maximal independent set of a graph __G__ is an independent set that is not contained properly in any other independent set of __G__. Let __i(G)__ denote the number of maximal independent sets of __G__. Here, we prove two conjectures, suggested by P. ErdΓΆs, that the maximum number of m