Article contents
The Hadamard conjecture and circuits of length four in a complete bipartite graph
Published online by Cambridge University Press: 09 April 2009
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.
MSC classification
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1982
References
- 3
- Cited by