<blockquote>
  <p>My concern is about the confusion between the use of the word "graph" to mean either a) a simple graph, without self-loops and parallel edges or b) a multigraph, that can have self-loops and parallel edges (i.e., multiple edges between the same pair of vertices).</p>
</blockquote>

<p>In the literature about Holant problems, the word "graph" should be read as "multigraph" unless otherwise stated.  As you noticed, I tried to be more explicit about this in my thesis.  In my experience, different areas of math use terms mostly consistently within their own area but in ways that would be contradictory when considering multiple areas and read strictly.</p>

<p>In your first example, the proper notation is <span class="math-container">$\mathrm{Holant}([x,y,z]|[t_1,t_2,t_3,t_4])$</span>.  This means that the input graphs are bipartite with one part having only vertices of degree 2 (and assigned the symmetric binary function <span class="math-container">$[x,y,z]$</span>) and the other part having only vertices of degree 3 (and assigned the symmetric ternary function [t_1, t_2, t_3, t_4]).</p>

<p>Also (and I am sure you know this, but to be clear), a bipartite graph cannot have self loops.  So if a bipartite graph is not a simple graph, then it is because it has parallel edges.</p>

<p>1) Yes</p>

<p>2) Not immediately.  I think you have correctly observed that their reductions work for simple graphs.  It remains to verify if the hard problems that they were reduced from are also hard when further restricted to simple graphs.</p>

<p>3) There is no general fix.  In general, you have to reduce from problems that are hard for simple graphs.</p>

<p>4) Gadget 2 does not satisfy your condition.  Consider <span class="math-container">$N_1$</span>.  The only two vertices of degree 2 without dangling edges have the same neighbor set.</p>

CC BY-SA 4.0
2019-05-21T17:29:50.093Z
Excellent, thanks a lot! I mentioned self loops mainly because, when you start from a 2-3-bipartite multigraph, contracting it could yield a 3-regular multigraph possibly with self loops. Following your answer and an observation by a3nm, I am almost able to solve my problem in https://cstheory.stackexchange.com/q/43888/38111. What I am missing is the hardness of counting matchings on 3-regular bipartite graphs (see comment). Do you know if this is known?
M.Monet
CC BY-SA 4.0
2019-05-21T02:06:21.917Z
2019-08-28T11:55:47.947Z
2019-08-28T11:55:47.947Z
Tyson Williams
<p>From what I can understand, <a href="https://en.wikipedia.org/wiki/Holographic_algorithm" rel="nofollow noreferrer">Holographic reductions for Holant problems</a> are used to show #P-hardness or polynomial time computability of certain counting problems on undirected graphs that have very restricted forms (for instance, 3-regular graphs, or 2-3-regular bipartite graphs).</p>

<p>My concern is about the confusion between the use of the word "graph" to mean either a) a <strong>simple graph</strong>, without self-loops and parallel edges or b) a <strong>multigraph</strong>, that can have self-loops and parallel edges (i.e., multiple edges between the same pair of vertices). I will first expose my problem by examples, then ask more precisely my questions.</p>

<p><strong>Examples:</strong></p>

<ul>
<li><p>In the paper <a href="http://pages.cs.wisc.edu/~jyc/papers/interpolation08.pdf" rel="nofollow noreferrer">Cai, Lu and Xia, Holographic Reduction, Interpolation and Hardness, 2012</a>, the authors provide a dichotomy for all problems of the form <span class="math-container">$\mathrm{Holant}([x,y,z][t_1,t_2,t_3,t_4])$</span>, so over 2-3-regular bipartite graphs. They do not specify if they talk about simple graphs or multigraphs. A search for "self loops" reveals that they might be using graphs with self loops, but this is not very explicit (and what about parallel edges?). However nowhere else in the paper this distinction is discussed, and all the gadgets they use seem to be simple graphs (in the Appendix).</p></li>
<li><p>In <a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.729.5304&amp;rep=rep1&amp;type=pdf" rel="nofollow noreferrer">Tyson Williams' thesis</a>, by default the graphs considered are multigraphs (see page 4). He also says that Holant problems always consider multigraphs, suggesting that the first paper I cited considers multigraphs. In some of his results, he mentions the distinction between the two notions of graphs: for instance, Theorem 10.2.7 states that some problem is hard on 3-regular multigraphs, and he shows in Theorem 10.2.8 that the same problem is aslo hard on 3-regular <em>simple</em> graphs. By looking at the proof you see that the trick used is specific to this particular problem.</p></li>
<li><p>In the paper <a href="https://www.sciencedirect.com/science/article/pii/S0304397507004653" rel="nofollow noreferrer">Xia, Zhang and Zhao, Computational complexity of counting problems on 3-regular planar graphs, 2007</a>, the abstract talks about 3-regular graphs. When I first read it I thought that they are considering simple graphs, but actually I did not find a place where they say this.</p></li>
</ul>

<p>At this point, I want to say that this post is not a critic to the authors of all these papers (I know that this kind of details can be annoying to present rigorously), the goal is just to clarify what is happening here.</p>

<p><strong>Questions:</strong></p>

<p>1) Do all the PTIME results of, say, the first paper I cite, work for multigraphs?</p>

<p>2) Do all the hardness results of that paper work for 2-3-regular <em>simple</em> bipartite graphs?</p>

<p>3) If not, is there a simple general fix so that the hardness results work for simple graphs, or does one have to find an ad hoc patch for each one of these problems? (for example, as in Theorem 10.2.8 of Tyson Williams' thesis)</p>

<p>4) If yes, do they also work for 2-3-regular simple graph that also satisfy this special property: no two nodes of the partition of degree 2 have the same neighbors. This condition would insure that, when you take a 2-3-regular simple graph that satisfies this, then contracting the nodes in the partition of degree 2 would always give a 3-regular simple graph. (without this condition, we could end up with parallel edges.)</p>

<p>This post is also related to <a href="https://cstheory.stackexchange.com/a/43905/38111">this post</a> and <a href="https://cstheory.stackexchange.com/q/43888/38111">this one</a>, where the same kind of confusion arose (a positive answer to question 4) would solve these problems). I decided to create a new question because I realized that the problem is more general that the ones exposed in these posts.</p>

CC BY-SA 4.0
2019-05-19T20:51:41.867Z
I don't know about these particular results, but from what I do know about holographic reductions in general, my guess would be that the upper bounds work for multigraphs, because holographic reductions typically aren't sensitive to simple vs. multigraphs, and the FKT algorithm just needs planarity, which is the same for multigraphs and simple graphs. That is, my guess to Q1 would be yes.
Joshua Grochow
<counting-complexity>
Holant problems and holographic reduction: simple graphs or multigraphs?
M.Monet
# Holant problems and holographic reduction: simple graphs or multigraphs?

(Asked by: username_0 on 2019-05-17)

From what I can understand, [Holographic reductions for Holant problems](https://en.wikipedia.org/wiki/Holographic_algorithm) are used to show #P-hardness or polynomial time computability of certain counting problems on undirected graphs that have very restricted forms (for instance, 3-regular graphs, or 2-3-regular bipartite graphs).

My concern is about the confusion between the use of the word "graph" to mean either a) a **simple graph**, without self-loops and parallel edges or b) a **multigraph**, that can have self-loops and parallel edges (i.e., multiple edges between the same pair of vertices). I will first expose my problem by examples, then ask more precisely my questions.

**Examples:**

* In the paper [Cai, Lu and Xia, Holographic Reduction, Interpolation and Hardness, 2012](http://pages.cs.wisc.edu/~jyc/papers/interpolation08.pdf), the authors provide a dichotomy for all problems of the form $\mathrm{Holant}([x,y,z][t\_1,t\_2,t\_3,t\_4])$, so over 2-3-regular bipartite graphs. They do not specify if they talk about simple graphs or multigraphs. A search for "self loops" reveals that they might be using graphs with self loops, but this is not very explicit (and what about parallel edges?). However nowhere else in the paper this distinction is discussed, and all the gadgets they use seem to be simple graphs (in the Appendix).
* In [username_2' thesis](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.729.5304&rep=rep1&type=pdf), by default the graphs considered are multigraphs (see page 4). He also says that Holant problems always consider multigraphs, suggesting that the first paper I cited considers multigraphs. In some of his results, he mentions the distinction between the two notions of graphs: for instance, Theorem 10.2.7 states that some problem is hard on 3-regular multigraphs, and he shows in Theorem 10.2.8 that the same problem is aslo hard on 3-regular *simple* graphs. By looking at the proof you see that the trick used is specific to this particular problem.
* In the paper [Xia, Zhang and Zhao, Computational complexity of counting problems on 3-regular planar graphs, 2007](https://www.sciencedirect.com/science/article/pii/S0304397507004653), the abstract talks about 3-regular graphs. When I first read it I thought that they are considering simple graphs, but actually I did not find a place where they say this.

At this point, I want to say that this post is not a critic to the authors of all these papers (I know that this kind of details can be annoying to present rigorously), the goal is just to clarify what is happening here.

**Questions:**

1) Do all the PTIME results of, say, the first paper I cite, work for multigraphs?

2) Do all the hardness results of that paper work for 2-3-regular *simple* bipartite graphs?

3) If not, is there a simple general fix so that the hardness results work for simple graphs, or does one have to find an ad hoc patch for each one of these problems? (for example, as in Theorem 10.2.8 of username_2' thesis)

4) If yes, do they also work for 2-3-regular simple graph that also satisfy this special property: no two nodes of the partition of degree 2 have the same neighbors. This condition would insure that, when you take a 2-3-regular simple graph that satisfies this, then contracting the nodes in the partition of degree 2 would always give a 3-regular simple graph. (without this condition, we could end up with parallel edges.)

This post is also related to [this post](https://cstheory.stackexchange.com/a/43905/38111) and [this one](https://cstheory.stackexchange.com/q/43888/38111), where the same kind of confusion arose (a positive answer to question 4) would solve these problems). I decided to create a new question because I realized that the problem is more general that the ones exposed in these posts.

**Tags:** counting-complexity

> **Comments:**
> **username_1**: I don't know about these particular results, but from what I do know about holographic reductions in general, my guess would be that the upper bounds work for multigraphs, because holographic reductions typically aren't sensitive to simple vs. multigraphs, and the FKT algorithm just needs planarity, which is the same for multigraphs and simple graphs. That is, my guess to Q1 would be yes.  

---

## 1 answers

### Answer by username_2 on 2019-05-21. Score: 3 | Accepted answer

> My concern is about the confusion between the use of the word "graph" to mean either a) a simple graph, without self-loops and parallel edges or b) a multigraph, that can have self-loops and parallel edges (i.e., multiple edges between the same pair of vertices).

In the literature about Holant problems, the word "graph" should be read as "multigraph" unless otherwise stated. As you noticed, I tried to be more explicit about this in my thesis. In my experience, different areas of math use terms mostly consistently within their own area but in ways that would be contradictory when considering multiple areas and read strictly.

In your first example, the proper notation is $\mathrm{Holant}([x,y,z]|[t\_1,t\_2,t\_3,t\_4])$. This means that the input graphs are bipartite with one part having only vertices of degree 2 (and assigned the symmetric binary function $[x,y,z]$) and the other part having only vertices of degree 3 (and assigned the symmetric ternary function [t\_1, t\_2, t\_3, t\_4]).

Also (and I am sure you know this, but to be clear), a bipartite graph cannot have self loops. So if a bipartite graph is not a simple graph, then it is because it has parallel edges.

1) Yes

2) Not immediately. I think you have correctly observed that their reductions work for simple graphs. It remains to verify if the hard problems that they were reduced from are also hard when further restricted to simple graphs.

3) There is no general fix. In general, you have to reduce from problems that are hard for simple graphs.

4) Gadget 2 does not satisfy your condition. Consider $N\_1$. The only two vertices of degree 2 without dangling edges have the same neighbor set.

> **Comments:**
> **username_0**: Excellent, thanks a lot! I mentioned self loops mainly because, when you start from a 2-3-bipartite multigraph, contracting it could yield a 3-regular multigraph possibly with self loops. Following your answer and an observation by a3nm, I am almost able to solve my problem in https://cstheory.stackexchange.com/q/43888/38111. What I am missing is the hardness of counting matchings on 3-regular bipartite graphs (see comment). Do you know if this is known?  

---

