Tensor networks and the enumeration of regular subgraphs
| dc.creator | Zograf, Peter | |
| dc.date | 2006-05-10 | |
| dc.date.accessioned | 2026-07-07T07:14:05Z | |
| dc.date.available | 2026-07-07T07:14:05Z | |
| dc.description | We propose a universal approach to a range of enumeration problems in graphs. The key point is in contracting suitably chosen symmetric tensors placed at the vertices of a graph along the edges. In particular, this leads to an algorithm that counts the number of d-regular subgraphs of an arbitrary graph including the number of d-factors (previously we considered the case d=2 with a special emphasis on the enumeration of Hamiltonian cycles; cf. math.CO/0403339). We briefly discuss the problem of the computational complexity of this algorithm. | |
| dc.identifier | https://arxiv.org/abs/math/0605256 | |
| dc.identifier | http://arxiv.org/abs/math/0605256 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/112727 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C45; 05C15 | |
| dc.title | Tensor networks and the enumeration of regular subgraphs | |
| dc.type | text |