The enumeration of edge colorings and Hamiltonian cycles by means of symmetric tensors

Simple item page
dc.creatorZograf, Peter
dc.date2004-03-21
dc.date.accessioned2026-07-07T05:06:35Z
dc.date.available2026-07-07T05:06:35Z
dc.descriptionFollowing Penrose, we introduce a family of graph functions defined in terms of contractions of certain products of symmetric tensors along the edges of a graph. Special cases of these functions enumerate edge colorings and cycles of arbitrary length in graphs (in particular, Hamiltonian cycles).
dc.identifierhttps://arxiv.org/abs/math/0403339
dc.identifierhttp://arxiv.org/abs/math/0403339
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/70525
dc.subjectCombinatorics
dc.titleThe enumeration of edge colorings and Hamiltonian cycles by means of symmetric tensors
dc.typetext

Files

Collections

arXiv