Enumeration of spanning subgraphs with degree constraints
| dc.creator | Wagner, David G. | |
| dc.date | 2004-12-02 | |
| dc.date | 2004-12-15 | |
| dc.date.accessioned | 2026-07-07T05:14:55Z | |
| dc.date.available | 2026-07-07T05:14:55Z | |
| dc.description | For a finite undirected multigraph G=(V,E) and functions f,g:V-->\NN, let N_f^g(G,j) denote the number of (f,g)-factors of G with exactly j edges. The Heilmann-Lieb Theorem implies that \sum_j N_0^1(G,j) t^j is a polynomial with only real (negative) zeros, and hence that the sequence {N_0^1(G,j)} is strictly logarithmically concave. Separate generalizations of this theorem were obtained by Ruelle and by the author. We unify, simplify, and generalize these results by means of the Grace-Szegö-Walsh Coincidence Theorem. | |
| dc.description | 15 pages. minor corrections and a new result | |
| dc.identifier | https://arxiv.org/abs/math/0412059 | |
| dc.identifier | http://arxiv.org/abs/math/0412059 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/73465 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A20; 05C30, 26C10, 30C15 | |
| dc.title | Enumeration of spanning subgraphs with degree constraints | |
| dc.type | text |