The Hadamard conjecture and circuits of length four in a complete bipartite graph
- 1 August 1981
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
- Vol. 31 (2) , 252-256
- https://doi.org/10.1017/s144678870003353x
Abstract
We show that the problem of settling the existence of an n × n Hadamard matrix, where n is divisible by 4, is equivalent to that of finding the cardinality of a smallest set T of 4-circuits in the complete bipartite graph K n, n, such that T contains at least one circuit of each copy of K2,3 in Kn, n.Keywords
This publication has 1 reference indexed in Scilit:
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969