user3483902

Is there extant a strong link between monotone circuits, and boolean circuits, or the paper is driving at some link between the two, that makes the bounds happen in computing the boolean function?

sure, looks like there is something like a tutte polynomial(for cuts) type count for cycles, but the formulation is a little difficult to understand, as it later takes into account multiple edges from a vertex take a look - mathoverflow.net/questions/177103/…

.. Part 3 ... Perhaps also relevant, in the application parallel edges are allowed. This is a rough formulation but the count is on the number of cycles in the cycle decomposition. Is there an efficient procedure for the count of cycles?

--- continued here Need to compute for all graphs that are subgraphs of a given regular lattice, up to some maximum number of edges (which I would like to make as large as possible). So for a square lattice (for now), which restricts to bipartite planar graphs, is there a polynomial that I can formulate?

The question goes something like this: each edge is a transposition on the n vertices,(so there is an ordered set of m-tuples for a graph of m edges)and so we can associate a permutation by taking the product of transpositions.Each edge appears only once.

I read an interesting graph theory question on the net, on math stackoverflow, some time back, I'm sure somebody in the TCS community could give some insight to the problem. The question is unanswered, and the question is what is the ethical policy about cross posting, if any, can this be done without the original user being notified?