Asymptotic behavior of the number of Eulerian orientations of graphs

We consider the class of simple graphs with large algebraic connectivity (the second-smallest eigenvalue of the Laplacian matrix). For this class of graphs we determine the asymptotic behavior of the number of Eulerian orientations. In addition, we establish some new properties of the Laplacian matrix, as well as an estimate of a conditionality of matrices with the asymptotic diagonal predominanceComment: arXiv admin note: text overlap with arXiv:1104.304

Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth

We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollobas, and Sorkin (2004) and by Aigner and van der Holst (2004). We present an algorithm to evaluate the multivariate interlace polynomial of a graph with n vertices given a tree decomposition of the graph of width k. The best previously known result (Courcelle 2008) employs a general logical framework and leads to an algorithm with running time f(k)*n, where f(k) is doubly exponential in k. Analyzing the GF(2)-rank of adjacency matrices in the context of tree decompositions, we give a faster and more direct algorithm. Our algorithm uses 2^{3k^2+O(k)}*n arithmetic operations and can be efficiently implemented in parallel.Comment: v4: Minor error in Lemma 5.5 fixed, Section 6.6 added, minor improvements. 44 pages, 14 figure

On a Generalization of Zaslavsky's Theorem for Hyperplane Arrangements

We define arrangements of codimension-1 submanifolds in a smooth manifold which generalize arrangements of hyperplanes. When these submanifolds are removed the manifold breaks up into regions, each of which is homeomorphic to an open disc. The aim of this paper is to derive formulas that count the number of regions formed by such an arrangement. We achieve this aim by generalizing Zaslavsky's theorem to this setting. We show that this number is determined by the combinatorics of the intersections of these submanifolds.Comment: version 3: The title had a typo in v2 which is now fixed. Will appear in Annals of Combinatorics. Version. 2: 19 pages, major revision in terms of style and language, some results improved, contact information updated, final versio

Fourientations and the Tutte polynomial

A fourientation of a graph is a choice for each edge of the graph whether to orient that edge in either direction, leave it unoriented, or biorient it. Fixing a total order on the edges and a reference orientation of the graph, we investigate properties of cuts and cycles in fourientations which give trivariate generating functions that are generalized Tutte polynomial evaluations of the form (k + m)[superscript n−1](k + l)[superscript gT](αk + βl + m/k + m , γ k + l + δm/ k + l) for α, γ ∈ {0, 1, 2} and β, δ ∈ {0, 1}. We introduce an intersection lattice of 64 cut–cycle fourientation classes enumerated by generalized Tutte polynomial evaluations of this form. We prove these enumerations using a single deletion–contraction argument and classify axiomatically the set of fourientation classes to which our deletion–contraction argument applies. This work unifies and extends earlier results for fourientations due to Gessel and Sagan (Electron J Combin 3(2):Research Paper 9, 1996), results for partial orientations due to Backman (Adv Appl Math, forthcoming, 2014. arXiv:1408.3962), and Hopkins and Perkinson (Trans Am Math Soc 368(1):709–725, 2016), as well as results for total orientations due to Stanley (Discrete Math 5:171–178, 1973; Higher combinatorics (Proceedings of NATO Advanced Study Institute, Berlin, 1976). NATO Advanced Study Institute series, series C: mathematical and physical sciences, vol 31, Reidel, Dordrecht, pp 51–62, 1977), Las Vergnas (Progress in graph theory (Proceedings, Waterloo silver jubilee conference 1982), Academic Press, New York, pp 367–380, 1984), Greene and Zaslavsky (Trans Am Math Soc 280(1):97–126, 1983), and Gioan (Eur J Combin 28(4):1351–1366, 2007), which were previously unified by Gioan (2007), Bernardi (Electron J Combin 15(1):Research Paper 109, 2008), and Las Vergnas (Tutte polynomial of a morphism of matroids 6. A multi-faceted counting formula for hyperplane regions and acyclic orientations, 2012. arXiv:1205.5424). We conclude by describing how these classes of fourientations relate to geometric, combinatorial, and algebraic objects including bigraphical arrangements, cycle–cocycle reversal systems, graphic Lawrence ideals, Riemann–Roch theory for graphs, zonotopal algebra, and the reliability polynomial. Keywords: Partial graph orientations, Tutte polynomial, Deletion–contraction, Hyperplane arrangements, Cycle–cocycle reversal system, Chip-firing, G-parking functions, Abelian sandpile model, Riemann–Roch theory for graphs, Lawrence ideals, Zonotopal algebra, Reliability polynomialNational Science Foundation (U.S.) (Grant 1122374

Orientations, lattice polytopes, and group arrangements II: Modular and integral flow Polynomials of graphs

We study modular and integral flow polynomials of graphs by means of subgroup arrangements and lattice polytopes. We introduce an Eulerian equivalence relation on orientations, flow arrangements, and flow polytopes; and we apply the theory of Ehrhart polynomials to obtain properties of modular and integral flow polynomials. The emphasis is on the geometrical treatment through subgroup arrangements and Ehrhart polynomials. Such viewpoint leads to a reciprocity law on the modular flow polynomial, which gives rise to an interpretation on the values of the modular flow polynomial at negative integers and answers a question by Beck and Zaslavsky.Regal Entertainment Group (Competitive Earmarked Research Grants 600703)Regal Entertainment Group (Competitive Earmarked Research Grants 600506)Regal Entertainment Group (Competitive Earmarked Research Grants 600608

The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems

We show that an effective version of Siegel’s Theorem on finiteness of integer solutions and an application of elementary Galois theory are key ingredients in a complexity classification of some Holant problems. These Holant problems, denoted by Holant(f), are defined by a symmetric ternary function f that is invariant under any permutation of the κ ≥ 3 domain elements. We prove that Holant(f) exhibits a complexity dichotomy. This dichotomy holds even when restricted to planar graphs. A special case of this result is that counting edge κ-colorings is #P-hard over planar 3-regular graphs for κ ≥ 3. In fact, we prove that counting edge κ-colorings is #P-hard over planar r-regular graphs for all κ ≥ r ≥ 3. The problem is polynomial-time computable in all other parameter settings. The proof of the dichotomy theorem for Holant(f) depends on the fact that a specific polynomial p(x, y) has an explicitly listed finite set of integer solutions, and the determination of the Galois groups of some specific polynomials. In the process, we also encounter the Tutte polynomial, medial graphs, Eulerian partitions, Puiseux series, and a certain lattice condition on the (logarithm of) the roots of polynomials.

On Barycentric Representation Of Graphs

We shall prove that the linear system associated to a barycentric representation always has a solution, we shall give a necessary and sufficient condition for this solution to be uniquely defined and then give a formal expression for this solution in terms of weighted arborescences. Then, in the planar case, we shall give some necessary and sufficient conditions for such a representation to be plane, given that the fixed vertices are embedded in convex position with a "compatible" circular order

Connected cutsets of a graph and triangle bases of the cycle space

AbstractWe investigate some properties of graohs whose cycle space has a basis constituted of triangles (‘null-homotopic’ graphs). We obtain characterizations in the case of planar graphs, and more generally, of graphs not contractible onto K5. These characterizations involve separating subsets and decompositions into triangulations of discs