Related papers: Cancellation and regularity for planar, 3-connecte…

Deciding whether a planar graph (even of maximum degree $4$) is $3$-colorable is NP-complete. Determining subclasses of planar graphs being $3$-colorable has a long history, but since Gr\"{o}tzsch's result that triangle-free planar graphs…

Feynman diagrams in $\phi^4$ theory have as their underlying structure 4-regular graphs. In particular, any 4-point $\phi^4$ graph can be uniquely derived from a 4-regular graph by deleting a vertex. The Feynman period is a simplified…

We prove a version of uniqueness theorem for Cuntz-Pimsner algebras of discrete product systems over semigroups of Ore type. To this end, we introduce Doplicher-Roberts picture of Cuntz-Pimsner algebras, and the semigroup dual to a product…

We present a formal version of the numbers of vertices, edges, and faces for infinite planar regular triangular meshes of degree r>6. These numbers are defined via Euler summation of sequences obtained from iterated expansions of a convex…

A graph is said to be cyclic $k$-edge-connected, if at least $k$ edges must be removed to disconnect it into two components, each containing a cycle. Such a set of $k$ edges is called a cyclic-$k$-edge cutset and it is called a trivial…

Sturmfels-Sullivant conjectured that the cut polytope of a graph is normal if and only if the graph has no K_5 minor. In the present paper, it is proved that the normality of cut polytopes of graphs is a minor closed property. By using this…

We give formulae for the first homology of the $n$-braid group and the pure 2-braid group over a finite graph in terms of graph theoretic invariants. As immediate consequences, a graph is planar if and only if the first homology of the…

Kronecker coefficients encode the tensor products of complex irreducible representations of symmetric groups. Their stability properties have been considered recently by several authors (Vallejo, Pak and Panova, Stembridge). In previous…

We study whether a given graph can be realized as an adjacency graph of the polygonal cells of a polyhedral surface in $\mathbb{R}^3$. We show that every graph is realizable as a polyhedral surface with arbitrary polygonal cells, and that…

This work re-examines a classical construction of a 2-connected (simple) graph where every intermediate graph is 2-connected before detailing an analogous construction for 3-connected graphs which requires a graph equivalence relation…

We determine the number of labelled chordal planar graphs with $n$ vertices, which is asymptotically $c_1\cdot n^{-5/2} \gamma^n n!$ for a constant $c_1>0$ and $\gamma \approx 11.89235$. We also determine the number of rooted simple chordal…

The core of a graph is the smallest graph (in terms of number of vertices) to which it is homomorphically equivalent. The question of the possible order of the core of the tensor product (also known as categorical, Heidetnemi or direct…

We give a complete characterization of the graph products of cyclic groups admitting a Polish group topology, and show that they are all realizable as the group of automorphisms of a countable structure. In particular, we characterize the…

In the present paper we construct the star products concerning scalar fields in the covariant case from a new approach. We construct the star products at three levels, which are levels of functions on Rd, fields and functionals…

We prove that certain conditions on multigraded Betti numbers of a simplicial complex $K$ imply existence of a higher Massey product in cohomology of a moment-angle-complex $\mathcal Z_K$, which contains a unique element (a strictly defined…

We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of math.CO/0307347 which treats the minimally generically rigid case. The proof…

Polyhedral products were defined by Bahri, Bendersky, Cohen and Gitler, to be spaces obtained as unions of certain product spaces indexed by the simplices of an abstract simplicial complex. In this paper we give a very general homotopy…

We present the new combinatorial class of product-coproduct prographs which are planar assemblies of two types of operators: products having two inputs and a single output and coproducts having a single input and two outputs. We show that…

Let $G$ be a graph, and $v\in V(G)$ and $S\subseteq V(G)\backslash v$ of size at least $k$. An important result on graph connectivity due to Perfect states that, if $v$ and $S$ are $k$-linked, then a $(k-1)$-link between a vertex $v$ and…

Gronwall conjecture states that a planar 3-web which admits more than one distinct linearization is locally equivalent to an algebraic web. We give a partial answer to the conjecture in the affirmative for the class of planar 3-webs with…