Cycle factorizations and one-faced graph embeddings
نویسندگان
چکیده
Consider factorizations into transpositions of an n-cycle in the symmetric group Sn. To every such factorization we assign a monomial in variables wij that retains the transpositions used, but forgets their order. Summing over all possible factorizations of n-cycles we obtain a polynomial that happens to admit a closed expression. From this expression we deduce a formula for the number of 1-faced embeddings of a given graph.
منابع مشابه
Cycle factorizations and 1-faced graph embeddings
Consider factorizations into transpositions of an n-cycle in the symmetric group Sn. To every such factorization we assign a monomial in variables wij that retains the transpositions used, but forgets their order. Summing over all possible factorizations of n-cycles we obtain a polynomial that happens to admit a closed expression. From this expression we deduce a formula for the number of 1-fac...
متن کاملLabeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملAmalgamations of factorizations of complete graphs
Let t be a positive integer and let L = (l1, . . . , lt) and K = (k1, . . . , kt) be collections of nonnegative integers. A (t, K,L)-factorization of a graph is a decomposition of the graph into factors F1, . . . , Ft such that Fi is ki-regular and at least li-edge-connected. In this paper we apply the technique of amalgamations of graphs to study (t, K,L)factorizations of complete graphs. In p...
متن کاملk-Cycle Free One-Factorizations of Complete Graphs
A one-factorization of a regular graph G is uniform if the union of any two one-factors is isomorphic to the same two-factor H, which is a disjoint union of even cycles. There are only several infinite classes of known uniform one-factorizations of complete graphs. An opposite property may be dealt with; one can ask about the existence of one-factorization such that the union of any two one-fac...
متن کاملHamilton Decompositions and (n/2)-Factorizations of Hypercubes
Since Qn, the hypercube of dimension n, is known to have n linkdisjoint paths between any two nodes, the links of Qn can be partitioned into multiple link-disjoint spanning subnetworks, or factors. We seek to identify factors which efficiently simulate Qn, while using only a portion of the links of Qn. We seek to identify (n/2)-factorizations, of Qn where 1) the factors have as small a diameter...
متن کامل