A Blossoming Algorithm for Tree Volumes of Composite Digraphs
|
|
- Timothy Simmons
- 5 years ago
- Views:
Transcription
1 A Blossoming Algorithm for Tree Volumes of Composite Digraphs Victor J. W. Guo Center for Combinatorics, LPMC, Nankai University, Tianjin 30007, People s Republic of China jwguo@eyou.com Abstract. A weighted composite digraph is obtained from some weighted digraph by replacing each vertex with a weighted digraph. In this paper, we give a beautiful combinatorial proof of the formula for forest volumes of composite digraphs obtained by Kelmans-Pak-Postnikov [7]. Moreover, a generalization of this formula is present. Keywords: composite digraph, tree volume, oriented tree volume, bijection Introduction The composite graph G(H,..., H n ) is obtained from the graph G on [n] by replacing each vertex i by a graph H i. It is a generalization of multipartite graph, whose complexity was studied by Knuth [8] and Kelmans [6]. The number of spanning trees of G(H,..., H n ) was obtained by Pak-Postnikov [9]. These papers generalized the encoding of Prüfer [0]. Recently, Kelmans-Pak-Postnikov [7] investigated the tree and forest volumes of weighted digraphs with algebraic methods, and deduced a nice formula for forest volumes of composite weighted digraphs. To give a combinatorial interpretation of Kelmans-Pak-Postnikov s formula, we notice that the composite digraph can always be obtained from a series of digraph-substitutions. This fact discloses the essence of a composite digraph. Based on it, we construct a bijection between two sets related to oriented trees. The bijection uses the ideas of Joyal [5] and Goulden-Jackson [3], who independently constructed an elegant encoding for bi-rooted trees. The Joyal encoding was also used by Stanley [2], Eǧecioǧlu-Remmel [, 2] and Guo [4] in their approachs to bipartite or multipartite trees. Although a bijective proof of Kelmans-Pak-Postnikov s formula may be given by using the Prüfer code, the proof applying the Joyal code is much more simple and straightforward. We introduce the concept of the oriented tree volume of a weighted digraph, and obtain a formula for oriented tree volumes of weighted composite digraphs, which is equivalent to Kelmans-Pak-Postnikov s formula. Moreover, a generalized form of this formula is present. 2 Notation and terminology A directed graph or simply a digraph G is a graph G with each edge uv endowed with a direction from u to v or v to u. The edge set and vertex set of G are denoted by V (G)
2 and E(G), respectively. The edge (or called arc) with direction from u to v is denoted by (u, v), and we call u the initial vertex and v the final vertex. The outdegree of a vertex v, denoted deg + G (v), is the number of edges of G with initial vertex v. Similarly, the indegree of v, denoted deg G (v), is the number of edges with final vertex v. An oriented tree (or in-tree) with root v is a digraph T with v as one of its vertices, such that there is a unique directed path from any vertex u to v. The set of spanning oriented trees of G is denoted by Sp(G). A weighted digraph G is a digraph G, such that each edge e of G is associated with an indeterminate t e (or an element of a commutative ring). For each vertex v of a weighted digraph G, we associate an indeterminate x v. Let T be a spanning oriented tree of G with root r. Define the weight ω(t ) and oriented weight ω(t ) of T by ω(t ) := x deg T v (v) t e, (2.) ω(t ) := v V (T ) v V (T ) x deg T (v) v e E(T ) e E(T ) t e, (2.2) where t e is the weight of the edge e. Now define the tree volume f G (x, t) and oriented tree volume f G (x, t) of G to be the polynomials in the variables (x v ) v V (G) and (t e ) e E(G) by f G (x, t) := f G (x, t) := T Sp(G) T Sp(G) ω(t ), (2.3) ω(t ). (2.4) Let G = (V, E) be a weighted digraph, G = {G v : v V } and H = {H v : v V } be two families of disjoint weighted digraphs such that H v is a subgraph of G v for every v V. We construct a new digraph Γ = G(G, H) as follows: (i) V (Γ) = v V V (G v ); (ii) E(Γ) = v V E(G v ) {(x, y): x V (H u ), y V (H v ), and (u, v) E(G)}; (iii) For x V (H u ), y V (H v ), and (u, v) E(G), the edge (x, y) is endowed with the weight t (x,y) = t (u,v). We call Γ the composition of G through (G, H). Denote by G(H) = G(H, H). If G u = G, H u = H, and G v = H v = {v} for v u, then G(G, H) is denoted by G[G, H, u], and we call G[G, H, u] a substitution of (G, H ) into G in place of u. When V (H ) = V (G ), G[G, H, u] is denoted by G[G, u]. Let G be a weighted digraph, we construct a weighted digraph G as follows: (i) V (G ) = V (G), where / V (G); 2
3 (ii) E(G ) = E(G) {(v, ): v V (G)}; (iii) Each edge (v, ) is weighted by t (v, ) =. We call G the cone of G. For convenience, we also write G for the cone of G with the new vertex. Now define the forest volume of G(H) to be the tree volume of the digraph G(H). Theorem 2. (Kelmans-Pak-Postnikov [7, Theorem.2]) We have f G(H) (x, t) = f G (x, t) xv=hv(x) f H v (x, t), (2.5) x =x +g v(x,t) where h v (x) = u V (H v) x u, and g v (x, t) = (v,a) E(G) h a(x)t (v,a). v V We will prove the above theorem in the last section. 3 The complete bipartite digraph Let R = {, 2,..., r}, S = {r +, r + 2,..., r + s}, and let K p,q r,s be the complete bipartite digraph with vertex set partitioned into R S, and for any i R and j S, the arcs (i, j) and (j, i) are weighted by t (i,j) = p i and t (j,i) = q i, respectively. Lemma 3. We have f K p,q r,s (x, t) = p p r (q x + + q r x r ) s (x r+ + + x r+s ) r (x q /p + + x r q r /p r + x r+ + + x r+s ). (3.) We will give a bijective proof of Lemma 3.. The bijection established here is a little different from Eǧecioǧlu-Remmel [] and the second solution of Stanley [2, pp ]. The following definitions and lemma play an important role. Definition 3.2 An element a i is called a left-to-right maximum of a permutation a a 2 a n, if a i > a j for every j < i. Let S n denote the set of all permutations on [n] := {, 2,..., n}. It is well known that a permutation can be written as a product of its distinct cycles. Definition 3.3 A standard representation of a permutation is a product of its distinct cycles satisfying that (a) each cycle is written with its largest element first, and (b) the cycles are written in increasing order of their largest element. Definition 3.4 For a permutation π, we define φ(π) to be the permutation obtained from π by writing it in standard form and erasing the parentheses. 3
4 Lemma 3.5 (cf. Stanley [, Proposition.3.]) The map φ: S n S n defined above is a bijection. If π S n has k cycles, then φ(π) has k left-to-right maxima. Example 3.6 For π = with standard form π = (42)(6)(73)(85), we have φ(π) = with left-to-right maxima 4, 6, 7, 8. Note that φ (or φ) is well-defined for any permutation π = a a 2 a k over [n] for k n. For instance, if π = 57249, then φ (π) = (5)(724)(9). Proof of Lemma 3.. Recall that R = {, 2,..., r} and S = {, 2,..., s } = {r +, r + 2,..., r + s}. We linearly order R and S by < 2 < < r and < 2 < < s, respectively, and we would not compare the elements between R and S. Suppose T Sp(Kr,s p,q ) with root v. There is a unique directed path π = a b a 2 b 2 a m b m from v 0 to v, where v 0 = if v R, and v 0 = if v S. By Lemma 3.5, we obtain φ (π ) = C C l from π = b b 2 b m, where φ is defined in Definition 3.4 and C,..., C l are cycles. Then define C k to be the cycle obtained from C k by replacing each b i with b i a i+. Specifically, the cycle C k = (b ib i+ b j ) corresponds to C k = (b i a i+ b i+ a i+2 b j a j+ ). Let D π be the disjoint union of the directed cycles C,..., C l. When we remove all the edges of the path π, we obtain a disjoint union of oriented trees. Merge these oriented trees and D π by identifying vertices with the same label. Then we obtain a weighted digraph θ v (T ) by endowing each arc e with initial (respectively, final) vertex i R with weight t e = p i (respectively, t e = q i ). It is clear that θ v : T θ v (T ) is a bijection. If v R, then we define the weight of θ v (T ) by ω(θ v (T )) = q v x v e E(θ v(t )) t e while if v S, then we define the weight of θ v (T ) by ω(θ v (T )) = p x v e E(θ v(t )) t e i R S i R S x deg (i) i. x deg (i) i, It is easy to see ω(t ) = ω(θ v (T )), and ω(θ v (T )) is a term in the expansion of p p r (q x + +q r x r ) s (x r+ + +x r+s ) r x v q v /p v if v R, or a term in p p r (q x + + q r x r ) s (x r+ + + x r+s ) r x v if v S. The lemma follows by summing over all v. Examples for r = 5, s = 8 are shown in Figure. 4 The bijections for substituted digraphs The substituted digraph plays an important part in composite digraphs. We modify the bijection in the argument of Lemma 3. to count oriented tree volumes of weighted substituted digraphs. The key idea is to visualize each small tree as a vertex, and a 4
5 Figure : The two cases for Lemma 3.. spanning oriented tree of a weighted substituted digraph is then something like a bipartite oriented tree. Let H be a subgraph of G. Define Sp(G, H) to be the set of spanning oriented trees of G with root in H, and denote by f G, H (x, t) := ω(t ). T Sp(G,H) Lemma 4. Let G, G be disjoint weighted digraphs, H V (G ), and u V (G). We have f G[G,H,u], G[H,u](x, t) = f G (x, t) xu=h (x) f G H (x, t) x =g u(x,t), (4.) where h (x) = v H x v, and g u (x, t) = (u,v) E(G) x vt (u,v). Proof. Let G 2 = G \ {u} and H 2 be the the set of vertices v such that (u, v) E(G), and let Ω be the set of four-tuples (T, T 2, w (), w (2) ) such that (i) T Sp(G H ), and T 2 Sp(G); (ii) w () and w (2) are words on H and H 2, respectively; (iii) w () = deg T 2 (u), and w (2) = deg T ( ). We want to construct a bijection between Sp(G[G, H, u], G[H, u]) and Ω. First linearly order H and V (G 2 ), respectively. Suppose T is a spanning oriented tree of G[G, H, u] with root r in G[H, u]. Deleting the edges of T between H and G 2, we obtain weighted oriented forests F and F 2, which are contained in G and G 2, respectively. The oriented tree in F or F 2 with root v is denoted by R v, and the root sets of F and F 2 are denoted by M and M 2, respectively. If r M, then we define v 0 to be min M 2, while if r M 2, then we define v 0 to be min M. Assume that r is the first vertex on the path from v 0 to r in T such that r V (R r ). We may obtain an oriented tree T from F by adding the vertex, and edges (v, ) (v M ), each weighted by. To obtain the oriented tree T 2 from F 2, we add the vertex 5
6 u. If r M, then we add edges (v, u) (v M 2 ) with weights in G, while if r M 2, then we add edges (v, u) (v M 2 \ {r}) and (u, r ) with weights in G. It remains to find out the words w () and w (2). Identifying each R v with v in T, we obtain a weighted oriented tree T rooted at r. Assume that the directed path from v 0 to r in T is π = p p 2 p 2m, and p i < p i2 < < p il are all the left-to-right maxima of p 2 p 4 p 2m 2. Let a k = p ik ( k l), and a l+ = p 2m. For any vertex v v 0, r of T, let D(v) denote the vertex z such that { (ak, z) E(T ), if v = a k+ ( k l), (v, z) E(T ), otherwise. Write M \{v 0, r} = {u, u 2,..., u q } and M 2 \{v 0, r} = {v, v 2,..., v s } in increasing order. Put { D(v )D(v w () 2 ) D(v s )r, if r M, = D(v )D(v 2 ) D(v s ), if r M 2, w (2) = D(u )D(u 2 ) D(u q ). It is clear that w () = deg T 2 (u) and w (2) = deg T ( ). The procedure from Ω to Sp(G[G, H, u], G[H, u]) is as follows: Given T = (T, T 2, w (), w (2) ) Ω, deleting the vertices and u of T and T 2, we get oriented forests F and F 2, respectively. The oriented tree in F or F 2 with root v is denoted by R v, and the root sets of F and F 2 are denoted by M and M 2, respectively. Suppose the root of T 2 is r. If r = u, then we define v 0 to be min M 2, r the entry in the last position of w (), and r the root of the oriented tree in F that contains r. Otherwise, (u, r ) E(T 2 ) for some vertex r, we denote r = r, and define v 0 to be min M. Write M \ {v 0, r} = {u, u 2,..., u q } and M 2 \ {v 0, r} = {v, v 2,..., v s } in increasing order. For the words w () and w (2), if we identify each letter (vertex) with the root of the oriented tree in F or F 2 that contains it, then we obtain words w () and w (2) on M and M 2, respectively. By the definition of Ω, we have w () = s + or s, according to r = u or not, and w (2) = q. Regard the following function ( ) v,..., v s, u,..., u q D 0 = w (),..., w () s, w (2),..., w (2) q as a digraph on M M 2, such that deg + (v 0 ) = deg + (r) = 0. We may recover the oriented tree T = θr (D 0 ) with root r by Lemma 3.. Let ( ) v,..., v s, u,..., u q D =. w (),..., w s (), w (2),..., w q (2) 6
7 Assume that the path from v 0 to r in T is π = p p 2 p 2m, and p i < p i2 < < p il are all the left-to-right maxima of p 2 p 4 p 2m 2. Let a k = p ik ( k l), and a l+ = p 2m. We now connect all the oriented trees in F or F 2 by drawing the following edges: (a k, D(a k+ )) ( k l), and (p 2m, r ); (v, D(v)), for v V (T ) \ {a, a 2,..., a l+, r}. Finally, endow the above edges with weights in G[G, H, u]. Thus we obtain a spanning oriented tree T of G[G, H, u] with root r (in G[H, u]). It is not difficult to see that the above two procedures are inverse to each other, therefore we obtain a bijection between Sp(G[G, H, u], G[H, u]) and Ω. We now define the weight of T = (T, T 2, w (), w (2) ) Ω by ω( T ) = ω(t )ω(t 2 )x deg T ( ) x deg T (u) 2 u k w () x k v w (2) x v t (u,v). It is straightforward to see that the above bijection T T is weight-preserving, that is, ω(t ) = ω( T ). Clearly, ω(t ) is a term of f G[G,H,u], G[H,u](x), while ω( T ) is a term in the expansion of fg (x, t) xu= P v H x v f G H (x, t) x = P v H 2 x vt (u,v). This completes the proof of (4.). Examples for Lemma 4. are given in Figures 2, 3, 4, and 5, where H = {, 2,..., 4 } = {2, 3,..., 25} and N = {, 2,..., } is the set of vertices adjacent to u in G. We leave out labels of those vertices in V (G ) \ H or V (G 2 ) \ N. But the root is labeled by r if necessary. 7
8 T u T T 2 w () = 6, 20, 2, 3, w (2) =, 6, 3, 5, 2, 8 Figure 2: Example for Lemma 4. in the case r H T w () = 6, 20, 2, 3, w (2) =, 6, 3, 5, 2, 8 T, T 2 ( ) D = ( θ 4 (T ) Figure 3: Explanation of w () and w (2) in Figure 2. 8 )
9 T 0 r r u T T 2 w () = 6, 20, 3, w (2) =, 3, 5, 7, 2, 3 5 Figure 4: Example for Lemma 4. in the case r V (G 2 ). 4 6 r T 4 6 r θ r (T ) 7 w () = 6, 20, 3, w (2) =, 3, 5, 7, 2, 3 T, T 2 ( ) D = ( r 6 4 r Figure 5: Explanation of w () and w (2) in Figure 4. 9 )
10 Note that, in the proof of Lemma 4., the bijection T (T, T 2, w (), w (2) ) transforms the root of T into the root of T 2 when it belongs to V (G 2 ), and vice versa. Hence we actually prove the following assertion: Lemma 4.2 Let G, G be disjoint weighted digraphs, G 0 a subgraph of G, u V (G), and H V (G ). If u V (G 0 ), then we have f G[G,H,u], G 0 [H,u](x, t) = f G, G0 (x, t) xu=h (x) f G H (x, t) x =g u(x,t), (4.2) while if u / V (G 0 ), we have f G[G,H,u], G 0 (x, t) = f G, G0 (x, t) xu=h (x) f G H (x, t) x =g u(x,t), (4.3) where h (x) = v H x v, and g u (x, t) = (u,v) E(G) x vt (u,v). 5 The blossoming theorem In the previous section, we obtain a formula for counting the oriented tree volume of a substituted digraph. By using Lemmas 4., 4.2, and a series of substitutions of digraphs and variables, we can deduce the main theorem of this paper. Theorem 5. (The Blossoming Theorem) Let G = (V, E) be a weighted digraph, and let G = {G v : v V }, H = {H v : v V } be two families of disjoint weighted digraphs such that H v is a subgraph of G v for every v V. We have f G(G,H), G(H) (x, t) = f G (h, t) hv=h v(x) v V f Gv H v (x, t) x =g v(x,t), (5.) where h v (x) = u V (H v) x u and g v (x, t) = (v,a) E(G) h a(x)t (v,a). In particular, f G(H) (x, t) = f G (h, t) hv=h v(x) v V f H v (x, t) x =g v(x,t). (5.2) Proof. Let V = {v, v 2,..., v n }. We introduce the following notation: G k := {G vi : i k} {({v j }, ): k + j n}, H k := {H vi : i k} {({v j }, ): k + j n}, { h (k) hv (x) = u V (H v (x) := x v) u, if v {v,..., v k }, x v, otherwise, g v (k) (x, t) := h a (k) (x)t (v,a), v V (G). (v,a) E(G) 0
11 By the definition of composite digraphs, it is easy to see G(G k, H k ) = G(G k, H k )[G vk, H vk, v k ], G(H k ) = G(H k )[H vk, v k ]. As we call (G vk, H vk ) a flower, the process from G = G(G 0, H 0 ) to G(G, H) = G(G n, H n ) is something like blossoming, and any linear ordering of V (G) leads to the same result G = G(G, H). Hence, it is proper to call the following proof the blossoming algorithm. By Lemma 4.2, for k m, we have f G(Gk,H k ), G(H k ) = f G(Gk,H k ), G(H k )(x, t) xvk =h vk (x) It follows that f G(Gk,H k ), G(H k )(x, t) xvi =h vi (x), k+ i n f Gvk H v k (x, t) x =g (k) v k (x,t). = f G(Gk,H k ), G(H k )(x, t) xvi =h vi (x), k i n f G vk H v k (x, t) x =g vk (x,t). By iteration of the above equation, we have f G(G,H), G(H) (x, t) = f G(Gn,H n), G(H n)(x, t) = f G(Gn,H n ), G(H n )(x, t) xvn =h vn (x) f G vn H vn (x, t) x =g vn (x,t) = f G(Gn 2,H n 2 ), G(H n 2 )(x, t) xvj =h vj (x, t) (x), n j n f Gvn H v n (x, t) x =g vn (x,t) f G vn H vn (x, t) x =g vn (x,t) = = f G(G0,H 0 ), G(H 0 )(x, t) xvi =h vi (x), i n = f G (h, t) hu=h u(x) v V j n f Gv H v (x, t) x =g v(x,t). f Gvj H v j (x, t) x =g vj (x,t) This completes the proof of (5.). An illustration of the blossoming process is shown in Figure 6, where the directed connection of H i and H j (or j) is meant that every vertex of H i is connected to every vertex of H j (or the vertex j) with the same direction and weight as the edge ij. Proof of Theorem 2.. The proof follows from (5.2) by replacing G with G and H with H { }, and the follwing obvious relations: f G(H) (x, t) = f G(H) (x, t) x, f G (x, t) xv=h v(x) = f G (x, t) xv=h v(x) x.
12 G 2 G G G G 4 G 2 G 3 G G G 2 G H G 2 5 G 2 H G G 4 Figure 6: The blossoming procedure. It is less obvious to see that (2.5) also leads to (5.2) by comparing the terms independent of x on both sides of (2.5). Thus they are in fact equivalent to each other. For a (weighted) graph G, G is understood to be an undirected graph, and the tree volume f G (x, t) is defined as (2.3), where Sp(G) denotes the set of spanning trees of G. Eq. (5.2) has many conclusions, we would mention the following: Corollary 5.2 Let G = (V, E) be a weighted graph, and let H = {H v : v V } be a family of disjoint weighted graphs. Then f G(H) (x, t) = f G (h, t) hv=h v(x) v V f H v (x, t) x =g v(x,t), where h v (x) = u V (H v) x u and g v (x, t) = (v,a) E(G) h a(x)t (v,a). Corollary 5.3 (Kelmans [6, Theorem ]) Let H v be the empty graph on n v vertices. Then f G(H) (x) = f G (h) hu=hu(x) (g v (x)) nv, where f G (x) = f G (x, t) te=. v V (G) Corollary 5.4 (Pak-Postnikov [9]) The number of spanning trees of G(H,..., H n ) is equal to H v H v deg T (v) f i (H v )g(v) i, T Sp(G) v V 2 v V i=
13 where f i (H v ) is the number of forests in H v with i roots and g(v) = References (v,a) E H a. [] O. Eǧecioǧlu and J. B. Remmel, Bijections for Cayley trees, spanning trees, and their q-analogues, J. Combin. Theory Ser. A 42 (986) [2] O. Eǧecioǧlu and J. B. Remmel, A bijection for spanning trees of complete multipartite graphs, Congr. Numer. 00 (994) [3] I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, John Wiely, New York, 983. [4] V. J. W. Guo, Spanning trees of complete multipartite graphs and combinatorial identities, preprint. [5] A. Joyal, Une théorie combinatoire des séries formelles, Adv. Math. 42 (98) 82. [6] A. K. Kelmans, Spanning trees of extended graphs, Combinatorica 2 () (992) [7] A. Kelmans, I. Pak, and A. Postnikov, Tree and forest volumes of graphs, available as DIMACS Technical Report , January [8] D. E. Knuth, Another enumeration of trees, Canad. J. Math. 20 (968) [9] I. M. Pak and A. E. Postnikov, Enumeration of spanning trees of certain graphs, Russian Math. Surveys 45 (3) (990) [0] H. Prüfer, Neuer Beweis eines Satzes über Permutationen, Arch. Math. Phys. 27 (98) [] R. P. Stanley, Enumerative Combinatorics, Vol., Wadsworth & Brooks/Cole, Monterey, California, 986. [2] R. P. Stanley, Enumerative Combinatorics, Vol. 2, Cambridge University Press, Cambridge,
ENUMERATION OF TREES AND ONE AMAZING REPRESENTATION OF THE SYMMETRIC GROUP. Igor Pak Harvard University
ENUMERATION OF TREES AND ONE AMAZING REPRESENTATION OF THE SYMMETRIC GROUP Igor Pak Harvard University E-mail: pak@math.harvard.edu Alexander Postnikov Massachusetts Institute of Technology E-mail: apost@math.mit.edu
More informationCharacteristic polynomials of skew-adjacency matrices of oriented graphs
Characteristic polynomials of skew-adjacency matrices of oriented graphs Yaoping Hou Department of Mathematics Hunan Normal University Changsha, Hunan 410081, China yphou@hunnu.edu.cn Tiangang Lei Department
More informationDIMACS Technical Report January 2000 TREE AND FOREST VOLUMES OF GRAPHS
DIMACS Technical Report 2000-03 January 2000 TREE AND FOREST VOLUMES OF GRAPHS by Alexander Kelmans RUTCOR, Rutgers University 640 Bartholomew Road, Piscataway, NJ 08854 and Department of Mathematics,
More informationRing Sums, Bridges and Fundamental Sets
1 Ring Sums Definition 1 Given two graphs G 1 = (V 1, E 1 ) and G 2 = (V 2, E 2 ) we define the ring sum G 1 G 2 = (V 1 V 2, (E 1 E 2 ) (E 1 E 2 )) with isolated points dropped. So an edge is in G 1 G
More informationCentral Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J
Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J Frank Curtis, John Drew, Chi-Kwong Li, and Daniel Pragel September 25, 2003 Abstract We study central groupoids, central
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
More informationNotes on the Matrix-Tree theorem and Cayley s tree enumerator
Notes on the Matrix-Tree theorem and Cayley s tree enumerator 1 Cayley s tree enumerator Recall that the degree of a vertex in a tree (or in any graph) is the number of edges emanating from it We will
More informationNoncommutative Abel-like identities
Noncommutative Abel-like identities Darij Grinberg draft, January 15, 2018 Contents 1. Introduction 1 2. The identities 3 3. The proofs 7 3.1. Proofs of Theorems 2.2 and 2.4...................... 7 3.2.
More informationTHE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES. Changwoo Lee. 1. Introduction
Commun. Korean Math. Soc. 18 (2003), No. 1, pp. 181 192 THE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES Changwoo Lee Abstract. We count the numbers of independent dominating sets of rooted labeled
More informationd 2 -coloring of a Graph
d -coloring of a Graph K. Selvakumar and S. Nithya Department of Mathematics Manonmaniam Sundaranar University Tirunelveli 67 01, Tamil Nadu, India E-mail: selva 158@yahoo.co.in Abstract A subset S of
More informationThe q-exponential generating function for permutations by consecutive patterns and inversions
The q-exponential generating function for permutations by consecutive patterns and inversions Don Rawlings Abstract The inverse of Fedou s insertion-shift bijection is used to deduce a general form for
More informationA Characterization of (3+1)-Free Posets
Journal of Combinatorial Theory, Series A 93, 231241 (2001) doi:10.1006jcta.2000.3075, available online at http:www.idealibrary.com on A Characterization of (3+1)-Free Posets Mark Skandera Department of
More informationGraphs and Their Applications (7)
11111111 I I I Graphs and Their Applications (7) by K.M. Koh* Department of Mathematics National University of Singapore, Singapore 117543 F.M. Dong and E.G. Tay Mathematics and Mathematics Education National
More informationAn Ore-type Condition for Cyclability
Europ. J. Combinatorics (2001) 22, 953 960 doi:10.1006/eujc.2001.0517 Available online at http://www.idealibrary.com on An Ore-type Condition for Cyclability YAOJUN CHEN, YUNQING ZHANG AND KEMIN ZHANG
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationThe cycle polynomial of a permutation group
The cycle polynomial of a permutation group Peter J. Cameron School of Mathematics and Statistics University of St Andrews North Haugh St Andrews, Fife, U.K. pjc0@st-andrews.ac.uk Jason Semeraro Department
More informationRao s degree sequence conjecture
Rao s degree sequence conjecture Maria Chudnovsky 1 Columbia University, New York, NY 10027 Paul Seymour 2 Princeton University, Princeton, NJ 08544 July 31, 2009; revised December 10, 2013 1 Supported
More informationAcyclic Digraphs arising from Complete Intersections
Acyclic Digraphs arising from Complete Intersections Walter D. Morris, Jr. George Mason University wmorris@gmu.edu July 8, 2016 Abstract We call a directed acyclic graph a CI-digraph if a certain affine
More informationSKEW-SPECTRA AND SKEW ENERGY OF VARIOUS PRODUCTS OF GRAPHS. Communicated by Ivan Gutman
Transactions on Combinatorics ISSN (print: 2251-8657, ISSN (on-line: 2251-8665 Vol. 4 No. 2 (2015, pp. 13-21. c 2015 University of Isfahan www.combinatorics.ir www.ui.ac.ir SKEW-SPECTRA AND SKEW ENERGY
More informationON WEAK CHROMATIC POLYNOMIALS OF MIXED GRAPHS
ON WEAK CHROMATIC POLYNOMIALS OF MIXED GRAPHS MATTHIAS BECK, DANIEL BLADO, JOSEPH CRAWFORD, TAÏNA JEAN-LOUIS, AND MICHAEL YOUNG Abstract. A mixed graph is a graph with directed edges, called arcs, and
More information1 Counting spanning trees: A determinantal formula
Math 374 Matrix Tree Theorem Counting spanning trees: A determinantal formula Recall that a spanning tree of a graph G is a subgraph T so that T is a tree and V (G) = V (T ) Question How many distinct
More informationACYCLIC DIGRAPHS GIVING RISE TO COMPLETE INTERSECTIONS
ACYCLIC DIGRAPHS GIVING RISE TO COMPLETE INTERSECTIONS WALTER D. MORRIS, JR. ABSTRACT. We call a directed acyclic graph a CIdigraph if a certain affine semigroup ring defined by it is a complete intersection.
More informationd-regular SET PARTITIONS AND ROOK PLACEMENTS
Séminaire Lotharingien de Combinatoire 62 (2009), Article B62a d-egula SET PATITIONS AND OOK PLACEMENTS ANISSE KASAOUI Université de Lyon; Université Claude Bernard Lyon 1 Institut Camille Jordan CNS UM
More informationOn imbalances in oriented multipartite graphs
Acta Univ. Sapientiae, Mathematica, 3, 1 (2011) 34 42 On imbalances in oriented multipartite graphs S. Pirzada King Fahd University of Petroleum and Minerals Dhahran, Saudi Arabia email: sdpirzada@yahoo.co.in
More informationSome Notes on Distance-Transitive and Distance-Regular Graphs
Some Notes on Distance-Transitive and Distance-Regular Graphs Robert Bailey February 2004 These are notes from lectures given in the Queen Mary Combinatorics Study Group on 13th and 20th February 2004,
More informationReverse mathematics of some topics from algorithmic graph theory
F U N D A M E N T A MATHEMATICAE 157 (1998) Reverse mathematics of some topics from algorithmic graph theory by Peter G. C l o t e (Chestnut Hill, Mass.) and Jeffry L. H i r s t (Boone, N.C.) Abstract.
More informationOn Weak Chromatic Polynomials of Mixed Graphs
On Weak Chromatic Polynomials of Mixed Graphs Daniel Blado California Institute of Technology Joseph Crawford Morehouse College July 27, 2012 Taïna Jean-Louis Amherst College Abstract Modeling of metabolic
More informationUsing Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems
Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems Jan van den Heuvel and Snežana Pejić Department of Mathematics London School of Economics Houghton Street,
More informationORBITAL DIGRAPHS OF INFINITE PRIMITIVE PERMUTATION GROUPS
ORBITAL DIGRAPHS OF INFINITE PRIMITIVE PERMUTATION GROUPS SIMON M. SMITH Abstract. If G is a group acting on a set Ω and α, β Ω, the digraph whose vertex set is Ω and whose arc set is the orbit (α, β)
More informationNoncommutative Abel-like identities
Noncommutative Abel-like identities Darij Grinberg detailed version draft, January 15, 2018 Contents 1. Introduction 1 2. The identities 3 3. The proofs 7 3.1. Proofs of Theorems 2.2 and 2.4......................
More informationA quasisymmetric function generalization of the chromatic symmetric function
A quasisymmetric function generalization of the chromatic symmetric function Brandon Humpert University of Kansas Lawrence, KS bhumpert@math.ku.edu Submitted: May 5, 2010; Accepted: Feb 3, 2011; Published:
More informationLaplacian Integral Graphs with Maximum Degree 3
Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,
More informationReachability relations and the structure of transitive digraphs
Reachability relations and the structure of transitive digraphs Norbert Seifter Montanuniversität Leoben, Leoben, Austria Vladimir I. Trofimov Russian Academy of Sciences, Ekaterinburg, Russia November
More informationGRAPH CHOOSABILITY AND DOUBLE LIST COLORABILITY. Hamid-Reza Fanaï
Opuscula Mathematica Vol. 30 No. 3 2010 http://dx.doi.org/10.7494/opmath.2010.30.3.271 GRAPH CHOOSABILITY AND DOUBLE LIST COLORABILITY Hamid-Reza Fanaï Abstract. In this paper, we give a sufficient condition
More informationSinks in Acyclic Orientations of Graphs
Sinks in Acyclic Orientations of Graphs David D. Gebhard Department of Mathematics, Wisconsin Lutheran College, 8800 W. Bluemound Rd., Milwaukee, WI 53226 and Bruce E. Sagan Department of Mathematics,
More informationDisjoint Hamiltonian Cycles in Bipartite Graphs
Disjoint Hamiltonian Cycles in Bipartite Graphs Michael Ferrara 1, Ronald Gould 1, Gerard Tansey 1 Thor Whalen Abstract Let G = (X, Y ) be a bipartite graph and define σ (G) = min{d(x) + d(y) : xy / E(G),
More informationArc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree S. Bessy and F. Havet, Projet Mascotte, CNRS/INRIA/UNSA, INRIA Sophia-Antipolis, 2004 route des Lucioles
More informationAcyclic and Oriented Chromatic Numbers of Graphs
Acyclic and Oriented Chromatic Numbers of Graphs A. V. Kostochka Novosibirsk State University 630090, Novosibirsk, Russia X. Zhu Dept. of Applied Mathematics National Sun Yat-Sen University Kaohsiung,
More informationChih-Hung Yen and Hung-Lin Fu 1. INTRODUCTION
TAIWANESE JOURNAL OF MATHEMATICS Vol. 14, No. 1, pp. 273-286, February 2010 This paper is available online at http://www.tjm.nsysu.edu.tw/ LINEAR 2-ARBORICITY OF THE COMPLETE GRAPH Chih-Hung Yen and Hung-Lin
More informationMINIMALLY NON-PFAFFIAN GRAPHS
MINIMALLY NON-PFAFFIAN GRAPHS SERGUEI NORINE AND ROBIN THOMAS Abstract. We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-pfaffian graphs minimal with respect
More informationCombinatorial aspects of elliptic curves
Formal Power Series and Algebraic Combinatorics Séries Formelles et Combinatoire Algébrique San Diego, California 2006 Combinatorial aspects of elliptic curves Gregg Musiker Abstract. Given an elliptic
More informationCOUNTING AND ENUMERATING SPANNING TREES IN (di-) GRAPHS
COUNTING AND ENUMERATING SPANNING TREES IN (di-) GRAPHS Xuerong Yong Version of Feb 5, 9 pm, 06: New York Time 1 1 Introduction A directed graph (digraph) D is a pair (V, E): V is the vertex set of D,
More informationCharacterization of Fixed Points in Sequential Dynamical Systems
Characterization of Fixed Points in Sequential Dynamical Systems James M. W. Duvall Virginia Polytechnic Institute and State University Department of Mathematics Abstract Graph dynamical systems are central
More informationPaths and cycles in extended and decomposable digraphs
Paths and cycles in extended and decomposable digraphs Jørgen Bang-Jensen Gregory Gutin Department of Mathematics and Computer Science Odense University, Denmark Abstract We consider digraphs called extended
More informationSOLUTION TO A COMBINATORIAL PUZZLE ARISING FROM MAYER S THEORY OF CLUSTER INTEGRALS
SOLUTION TO A COMBINATORIAL PUZZLE ARISING FROM MAYER S THEORY OF CLUSTER INTEGRALS OLIVIER BERNARDI Abstract. Mayer s theory of cluster integrals allows one to write the partition function of a gas model
More informationHamiltonian cycles in circulant digraphs with jumps 2, 3, c [We need a real title???]
Hamiltonian cycles in circulant digraphs with jumps,, c [We need a real title???] Abstract [We need an abstract???] 1 Introduction It is not known which circulant digraphs have hamiltonian cycles; this
More informationEnumerative properties of Ferrers graphs
Enumerative properties of Ferrers graphs Richard Ehrenborg and Stephanie van Willigenburg To Lou Billera and André Joyal on their 3 4 5th birthdays Abstract We define a class of bipartite graphs that correspond
More informationOn shredders and vertex connectivity augmentation
On shredders and vertex connectivity augmentation Gilad Liberman The Open University of Israel giladliberman@gmail.com Zeev Nutov The Open University of Israel nutov@openu.ac.il Abstract We consider the
More informationAcyclic orientations of graphs
Discrete Mathematics 306 2006) 905 909 www.elsevier.com/locate/disc Acyclic orientations of graphs Richard P. Stanley Department of Mathematics, University of California, Berkeley, Calif. 94720, USA Abstract
More informationBetter bounds for k-partitions of graphs
Better bounds for -partitions of graphs Baogang Xu School of Mathematics, Nanjing Normal University 1 Wenyuan Road, Yadong New District, Nanjing, 1006, China Email: baogxu@njnu.edu.cn Xingxing Yu School
More informationParking cars after a trailer
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 70(3) (2018), Pages 402 406 Parking cars after a trailer Richard Ehrenborg Alex Happ Department of Mathematics University of Kentucky Lexington, KY 40506 U.S.A.
More informationChromatic bases for symmetric functions
Chromatic bases for symmetric functions Soojin Cho Department of Mathematics Ajou University Suwon 443-749, Korea chosj@ajou.ac.kr Stephanie van Willigenburg Department of Mathematics University of British
More informationLARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS
Bull. Korean Math. Soc. 51 (2014), No. 4, pp. 1229 1240 http://dx.doi.org/10.4134/bkms.2014.51.4.1229 LARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS Su Hyung An, Sen-Peng Eu, and Sangwook Kim Abstract.
More informationHamilton Cycles in Digraphs of Unitary Matrices
Hamilton Cycles in Digraphs of Unitary Matrices G. Gutin A. Rafiey S. Severini A. Yeo Abstract A set S V is called an q + -set (q -set, respectively) if S has at least two vertices and, for every u S,
More information18.312: Algebraic Combinatorics Lionel Levine. Lecture 19
832: Algebraic Combinatorics Lionel Levine Lecture date: April 2, 20 Lecture 9 Notes by: David Witmer Matrix-Tree Theorem Undirected Graphs Let G = (V, E) be a connected, undirected graph with n vertices,
More informationACYCLIC ORIENTATIONS AND CHROMATIC GENERATING FUNCTIONS. Ira M. Gessel 1
ACYCLIC ORIENTATIONS AND CHROMATIC GENERATING FUNCTIONS Ira M. Gessel 1 Department of Mathematics Brandeis University Waltham, MA 02454-9110 gessel@brandeis.edu www.cs.brandeis.edu/ ~ ira June 2, 1999
More informationReachability relations and the structure of transitive digraphs
Reachability relations and the structure of transitive digraphs Norbert Seifter Montanuniversität Leoben, Leoben, Austria seifter@unileoben.ac.at Vladimir I. Trofimov Russian Academy of Sciences, Ekaterinburg,
More informationMultipartite tournaments with small number of cycles
Multipartite tournaments with small number of cycles Gregory Gutin and Arash Rafiey Department of Computer Science Royal Holloway, University of London Egham, Surrey, TW20 0EX, UK Gutin(Arash)@cs.rhul.ac.uk
More informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
More informationGraph G = (V, E). V ={vertices}, E={edges}. V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}
Graph Theory Graph G = (V, E). V ={vertices}, E={edges}. a b c h k d g f e V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)} E =16. Digraph D = (V, A). V ={vertices}, E={edges}.
More informationMorse functions statistics
P H A S I S Journal Program F U N C T I O N A L A N A L Y S I S and Other Mathematics, 006, 11, 97 103 Morse functions statistics Liviu I. Nicolaescu Abstract. We prove a conjecture of V. I. Arnold concerning
More informationRESEARCH ARTICLE. An extension of the polytope of doubly stochastic matrices
Linear and Multilinear Algebra Vol. 00, No. 00, Month 200x, 1 15 RESEARCH ARTICLE An extension of the polytope of doubly stochastic matrices Richard A. Brualdi a and Geir Dahl b a Department of Mathematics,
More informationAutomorphism groups of wreath product digraphs
Automorphism groups of wreath product digraphs Edward Dobson Department of Mathematics and Statistics Mississippi State University PO Drawer MA Mississippi State, MS 39762 USA dobson@math.msstate.edu Joy
More informationNote. A Note on the Binomial Drop Polynomial of a Poset JOE BUHLER. Reed College, Portland, Oregon AND RON GRAHAM
JOURNAL OF COMBINATORIAL THEORY, Series A 66, 321-326 (1994) Note A Note on the Binomial Drop Polynomial of a Poset JOE BUHLER Reed College, Portland, Oregon 97202 AND RON GRAHAM AT&T Bell Laboratories,
More informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationOn two conjectures about the proper connection number of graphs
On two conjectures about the proper connection number of graphs Fei Huang, Xueliang Li, Zhongmei Qin Center for Combinatorics and LPMC arxiv:1602.07163v3 [math.co] 28 Mar 2016 Nankai University, Tianjin
More informationPRIMARY DECOMPOSITION FOR THE INTERSECTION AXIOM
PRIMARY DECOMPOSITION FOR THE INTERSECTION AXIOM ALEX FINK 1. Introduction and background Consider the discrete conditional independence model M given by {X 1 X 2 X 3, X 1 X 3 X 2 }. The intersection axiom
More informationOn decomposing graphs of large minimum degree into locally irregular subgraphs
On decomposing graphs of large minimum degree into locally irregular subgraphs Jakub Przyby lo AGH University of Science and Technology al. A. Mickiewicza 0 0-059 Krakow, Poland jakubprz@agh.edu.pl Submitted:
More information1.3 Vertex Degrees. Vertex Degree for Undirected Graphs: Let G be an undirected. Vertex Degree for Digraphs: Let D be a digraph and y V (D).
1.3. VERTEX DEGREES 11 1.3 Vertex Degrees Vertex Degree for Undirected Graphs: Let G be an undirected graph and x V (G). The degree d G (x) of x in G: the number of edges incident with x, each loop counting
More informationSelf-dual interval orders and row-fishburn matrices
Self-dual interval orders and row-fishburn matrices Sherry H. F. Yan Department of Mathematics Zhejiang Normal University Jinhua 321004, P.R. China huifangyan@hotmail.com Yuexiao Xu Department of Mathematics
More informationThe number of Euler tours of random directed graphs
The number of Euler tours of random directed graphs Páidí Creed School of Mathematical Sciences Queen Mary, University of London United Kingdom P.Creed@qmul.ac.uk Mary Cryan School of Informatics University
More informationA Quadratic Integer Programming with Application in Chaotic Mappings of Complete Multipartite Graphs. Technical Report
A Quadratic Integer Programming with Application in Chaotic Mappings of Complete Multipartite Graphs Technical Report Department of Computer Science and Engineering University of Minnesota 4-192 EECS Building
More informationIn this paper, we will investigate oriented bicyclic graphs whose skew-spectral radius does not exceed 2.
3rd International Conference on Multimedia Technology ICMT 2013) Oriented bicyclic graphs whose skew spectral radius does not exceed 2 Jia-Hui Ji Guang-Hui Xu Abstract Let S(Gσ ) be the skew-adjacency
More informationPartitions, rooks, and symmetric functions in noncommuting variables
Partitions, rooks, and symmetric functions in noncommuting variables Mahir Bilen Can Department of Mathematics, Tulane University New Orleans, LA 70118, USA, mcan@tulane.edu and Bruce E. Sagan Department
More informationA well-quasi-order for tournaments
A well-quasi-order for tournaments Maria Chudnovsky 1 Columbia University, New York, NY 10027 Paul Seymour 2 Princeton University, Princeton, NJ 08544 June 12, 2009; revised April 19, 2011 1 Supported
More informationSome Nordhaus-Gaddum-type Results
Some Nordhaus-Gaddum-type Results Wayne Goddard Department of Mathematics Massachusetts Institute of Technology Cambridge, USA Michael A. Henning Department of Mathematics University of Natal Pietermaritzburg,
More informationUnmixed Graphs that are Domains
Unmixed Graphs that are Domains Bruno Benedetti Institut für Mathematik, MA 6-2 TU Berlin, Germany benedetti@math.tu-berlin.de Matteo Varbaro Dipartimento di Matematica Univ. degli Studi di Genova, Italy
More informationDecomposition of random graphs into complete bipartite graphs
Decomposition of random graphs into complete bipartite graphs Fan Chung Xing Peng Abstract We consider the problem of partitioning the edge set of a graph G into the minimum number τg of edge-disjoint
More informationThe Binding Number of Trees and K(1,3)-free Graphs
The Binding Number of Trees and K(1,3)-free Graphs Wayne Goddard 1 Department of Mathematics Massachusetts Institute of Technology Cambridge, MA 02139 Abstract The binding number of a graph G is defined
More informationTransforming Inductive Proofs to Bijective Proofs
Transforming Inductive Proofs to Bijective Proofs Nathaniel Shar Stanford University nshar@stanford.edu June 2010 1 Introduction A bijective proof of an identity A = B is a pair of sets S,T and a bijection
More informationENUMERATIVE APPLICATIONS OF SYMMETRIC FUNCTIONS. Ira M. GESSEL 1
Publ. I.R.M.A. Strasbourg, 1987, 229/S 08 Actes 17 e Séminaire Lotharingien, p. 5-21 ENUMERATIVE APPLICATIONS OF SYMMETRIC FUNCTIONS BY Ira M. GESSEL 1 1. Introduction. This paper consists of two related
More informationThe Singapore Copyright Act applies to the use of this document.
Title On graphs whose low polynomials have real roots only Author(s) Fengming Dong Source Electronic Journal of Combinatorics, 25(3): P3.26 Published by Electronic Journal of Combinatorics This document
More informationTopics in Graph Theory
Topics in Graph Theory September 4, 2018 1 Preliminaries A graph is a system G = (V, E) consisting of a set V of vertices and a set E (disjoint from V ) of edges, together with an incidence function End
More informationEnumeration of subtrees of trees
Enumeration of subtrees of trees Weigen Yan a,b 1 and Yeong-Nan Yeh b a School of Sciences, Jimei University, Xiamen 36101, China b Institute of Mathematics, Academia Sinica, Taipei 1159. Taiwan. Theoretical
More informationPaths with two blocks in n-chromatic digraphs
Paths with two blocks in n-chromatic digraphs L. Addario-Berry, F. Havet and S. Thomassé September 20, 2005 Abstract We show that every oriented path of order n 4 with two blocks is contained in every
More informationThe Turán number of sparse spanning graphs
The Turán number of sparse spanning graphs Noga Alon Raphael Yuster Abstract For a graph H, the extremal number ex(n, H) is the maximum number of edges in a graph of order n not containing a subgraph isomorphic
More informationDISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS
DISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER In memory of Mike Albertson. Abstract. A distinguishing partition for an action of a group Γ on a set
More informationStrongly chordal and chordal bipartite graphs are sandwich monotone
Strongly chordal and chordal bipartite graphs are sandwich monotone Pinar Heggernes Federico Mancini Charis Papadopoulos R. Sritharan Abstract A graph class is sandwich monotone if, for every pair of its
More informationMulti-coloring and Mycielski s construction
Multi-coloring and Mycielski s construction Tim Meagher Fall 2010 Abstract We consider a number of related results taken from two papers one by W. Lin [1], and the other D. C. Fisher[2]. These articles
More informationTransversal and cotransversal matroids via their representations.
Transversal and cotransversal matroids via their representations. Federico Ardila Submitted: May, 006; Accepted: Feb. 7, 007 Mathematics Subject Classification: 05B5; 05C8; 05A99 Abstract. It is known
More informationThe Topology of Intersections of Coloring Complexes
The Topology of Intersections of Coloring Complexes Jakob Jonsson October 19, 2005 Abstract In a construction due to Steingrímsson, a simplicial complex is associated to each simple graph; the complex
More informationProperties of θ-super positive graphs
Properties of θ-super positive graphs Cheng Yeaw Ku Department of Mathematics, National University of Singapore, Singapore 117543 matkcy@nus.edu.sg Kok Bin Wong Institute of Mathematical Sciences, University
More informationarxiv: v1 [math.co] 10 Sep 2010
Ranking and unranking trees with a given number or a given set of leaves arxiv:1009.2060v1 [math.co] 10 Sep 2010 Jeffery B. Remmel Department of Mathematics U.C.S.D., La Jolla, CA, 92093-0112 jremmel@ucsd.edu
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationLongest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs
Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs Gregory Gutin Department of Mathematical Sciences Brunel, The University of West London Uxbridge, Middlesex,
More informationGroup connectivity of certain graphs
Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected
More informationDecomposing planar cubic graphs
Decomposing planar cubic graphs Arthur Hoffmann-Ostenhof Tomáš Kaiser Kenta Ozeki Abstract The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree,
More informationPermutation groups/1. 1 Automorphism groups, permutation groups, abstract
Permutation groups Whatever you have to do with a structure-endowed entity Σ try to determine its group of automorphisms... You can expect to gain a deep insight into the constitution of Σ in this way.
More informationA bijective proof of Shapiro s Catalan convolution
A bijective proof of Shapiro s Catalan convolution Péter Hajnal Bolyai Institute University of Szeged Szeged, Hungary Gábor V. Nagy {hajnal,ngaba}@math.u-szeged.hu Submitted: Nov 26, 2013; Accepted: May
More informationChordal Graphs, Interval Graphs, and wqo
Chordal Graphs, Interval Graphs, and wqo Guoli Ding DEPARTMENT OF MATHEMATICS LOUISIANA STATE UNIVERSITY BATON ROUGE, LA 70803-4918 E-mail: ding@math.lsu.edu Received July 29, 1997 Abstract: Let be the
More information