Signed Hypergraph Designs and Diagonal Forms for Some Incidence Matrices

Designs, Codes, and Cryptography

Volumn 17, Issue 1-3, 1999, Pages 289-297

  Wilson, Richard M ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346399809     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1026443629848     Document Type: Article

References (9)

1. A. E. Brouwer and C. A. van Eijl, On the p-rank of the adjacency matrices of strongly regular graphs, J. Alg. Combinatorics, Vol. 1 (1992) pp. 329-346.
2. R. L. Graham, S.-Y. R. Li, and W.-C. W. Li, On the structure of t-designs, SIAM J. Alg. Disc. Meth., Vol. 1 (1980) pp. 8-14.
3. P. Frankl, Intersection theorems and mod p rank of inclusion matrices, J. Combinatorial Theory, Ser. A, Vol. 54 (1990) pp. 85-94.
4. J. E. Graver and W. B. Jurkat, The module structure of integral designs. J. Combinatorial Theory, Vol. 15 (1973) pp. 75-90.
5. n, J. Algebra, Vol. 46 (1977) pp. 430-450.
6. A. Schrijver, Theory of Linear and Integer Programming, Wiley (1986).
7. R. M. Wilson, The necessary conditions for t-designs are sufficient for something, Utilitas Mathematics, Vol. 4 (1973) pp. 207-217.
8. R. M. Wilson, Decompositions of complete graphs into subgraphs isomorphic to a given graph, Proc. Fifth British Combinatorial Conference (C. St. J. A. Nash-Williams and J. Sheehan, eds.), Congressus Numerantium, XV, Utilitas Mathematica Publ. (1975) pp. 647-659.
9. R. M. Wilson, A diagonal form for the incidence matrices of t-subsets vs. k-subsets, Europ. J. Combinatorics, Vol. 11 (1990) pp. 609-615.