Noble, Steven (2006) Evaluating the rank generating function of a graphic 2-polymatroid. Combinatorics, Probability and Computing 15 (3), pp. 449-461. ISSN 0963-5483.
Abstract
We consider the complexity of the two-variable rank generating function, $S$, of a graphic 2-polymatroid. For a graph $G$, $S$ is the generating function for the number of subsets of edges of $G$ having a particular size and incident with a particular number of vertices of $G$. We show that for any $x, y \in \mathbb{Q}$ with $xy \not =1$, it is #P-hard to evaluate $S$ at $(x,y)$. We also consider the $k$-thickening of a graph and computing $S$ for the $k$-thickening of a graph.
Metadata
| Item Type: | Article |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 20 Jul 2020 11:46 |
| Last Modified: | 09 Aug 2023 12:48 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/32600 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
