Hostname: page-component-6bf8c574d5-mggfc Total loading time: 0 Render date: 2025-02-20T08:17:49.544Z Has data issue: false hasContentIssue false
  • English
  • Français

Evaluating the Rank Generating Function of a Graphic 2-Polymatroid

Published online by Cambridge University Press:  07 April 2006

S. D. NOBLE
S. D. NOBLE
Affiliation:
Department of Mathematical Sciences, Brunel University, Kingston Lane, Uxbridge UB8 3PH, UK (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

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.

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 15 , Issue 3 , May 2006 , pp. 449 - 461
Copyright
2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)