This is the authors' abstract. We don't add key points for this paper.
The ground states of a quenched random Ising spin system with variable concentration of mixed nearest-neighbour exchange couplings +or-J on a square lattice (frustration model) are studied by a new method of graph theory. The search for ground states is mapped into the problem of perfect matching of minimum weight in the graph of frustrated plaquettes, a problem which can be solved by the algorithm of Edmonds. A pedestrian presentation of this elaborated algorithm is given with a discussion of the condition of validity.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Bieche et al. (1980) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: