Doubly dependent sets in graphs

Australasian Journal of Combinatorics

Volumn 22, Issue , 2000, Pages 105-116

  Horrocks, David G C ^a  

^a UNIVERSITY OF PRINCE EDWARD ISLAND   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0008334240     PISSN: 10344942     EISSN: 22023518     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. I. Anderson, Combinatorics of Finite Sets, Oxford University Press, New York, 1987.
2. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, American Elsevier, New York, 1976.
3. P. Hall, On representatives of subsets, J. London Math. Soc. 10 (1935), 26-30.
4. D. G. C. Horrocks, On Lih's Conjecture concerning Spernerity, Europ. J. Combinatorics 20 (1999),131-148.
5. D. G. C. Horrocks, On the Number of Dependent Sets in a Connected Graph, Ars Combinatoria 53 (1999), 239-247.
6. K. W. Lih, Sperner families over a subset, J. Combinatorial Theory A 29 (1980), 182-185.
7. X. Zha, On a Conjecture on the Sperner Property, Europ. J. Combinatorics 10 (1989), 603-607.
8. Ying-xian Zhu, A note on a conjecture of Sperner property, J. Math. Res. Exposition (China) 4 (1984), 148.