DISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS
|
|
- Gervais Brooks
- 5 years ago
- Views:
Transcription
1 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 X is a partition of X that is preserved by no nontrivial element of Γ. As a special case, a distinguishing partition of a graph is a partition of the vertex set that is preserved by no nontrivial automorphism. In this paper we provide a link between distinguishing partitions of complete equipartite graphs and asymmetric uniform hypergraphs. Suppose that m 1 and n 2. We show that an asymmetric n-uniform hypergraph with m edges exists if and only if m f(n), where f(2) = f(14) = 6, f(6) = 5, and f(n) = log 2 (n + 1) + 2 otherwise. It follows that a distinguishing partition of K m(n) = K n,n,...,n, or equivalently for the wreath product action S n Wr S m, exists if and only if m f(n). 1. Introduction A coloring of the vertices of a graph G, c : V (G) {1, 2,..., r}, is said to be r- distinguishing if there are no nontrivial color-preserving automorphisms of G. The distinguishing number D(G) of G is the smallest r for which such a coloring exists. Let V (G) = {v 1, v 2,..., v n }; the coloring c(v i ) = i is trivially n-distinguishing, so the distinguishing number is well-defined for all graphs. Albertson and Collins introduced these ideas in [1]; since then this topic has been well studied (c.f. [2, 4, 7]). These ideas were generalized to group actions by Tymoczko in [9]. Let Γ be a group acting on a set X. A coloring of X, c : X {1, 2,..., r}, is r-distinguishing if the only element in Γ that preserves the coloring is the identity. The distinguishing number of this action, denoted D Γ (X), is the smallest r for which such a coloring exists. Thus, D(G) = D Aut G (V (G)). For further study in the setting of group actions see [5, 6, 8, 10]. Colorings of a set X are closely related to partitions. Any coloring of X gives a partition of X into color classes, while any partition yields colorings by assigning a unique color to the elements of each part. If a group Γ acts on X, each element of Γ that preserves a coloring also preserves the associated partition, but the converse is not necessarily true. For example, the only graph automorphism that preserves the coloring in Figure 1 is the identity (so it is a distinguishing coloring), but the automorphism (uw)(vx) preserves the color class partition {{u, v}, {w, x}}. Therefore, the idea of a distinguishing coloring may be modified to give the related but not identical idea of a distinguishing partition. A partition of X is a 2000 Mathematics Subject Classification. Primary 05C25; secondary 05C65, 20B25. Key words and phrases. complete equipartite graph, distinguishing number, distinguishing partition, asymmetric uniform hypergraph. 1
2 2 M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER Figure 1. The automorphism (uw)(vx) preserves the partition but not the coloring. distinguishing partition if the only element in Γ that preserves the partition is the identity. In a graph, this translates to a partition of V (G) such that there are no nontrivial automorphisms that preserve this partition. Distinguishing partitions seem to be a natural concept, as other important ideas for group actions, such as primitivity, are defined in terms of the effect of elements of Γ on partitions of X. Unlike distinguishing colorings, not all group actions or graphs admit a distinguishing partition. For example, if n 2 then K n does not. Thus, a fundamental question for a group action or graph is whether or not it has a distinguishing partition. This appears to be a difficult question. In this paper we explore a general property of distinguishing partitions. Then we show that even for the complete equipartite graph K m(n) = K n,n,...,n (having m parts of size n) it is not totally straightforward to say when it has a distinguishing partition. For a fixed n, we provide lower bounds for m and show these are best possible. To arrive at these bounds, a connection to asymmetric uniform hypergraphs is established. 2. Hypergraphs and a General Property A hypergraph H is a triple (V (H), E(H), I(H)), where V (H) is a finite set of elements called vertices, E(H) is a finite set of elements called edges, and I(H) V (H) E(H) is the incidence relation. If (v, e) I(H), then we say the vertex v is incident with the edge e. Often the incidence relation I(H) is presented as an incidence matrix M(H) = (m ij ), with rows indexed by vertices v i and columns indexed by edges e j. The entry m ij = 1 if (v i, e j ) I(H), and m ij = 0 otherwise. If v is incident with exactly n edges, then we say the degree of v is n; if all vertices v V (H) have degree n, then H is n-regular. Similarly, if there are exactly n vertices incident with an edge e, then we say the size of e is n; if all edges e E(H) have size n, then H is n-uniform. A graph is simply a 2-uniform hypergraph. Define the sets E H (v) = {e E(H) (v, e) I(H)} and V H (e) = {v V (H) (v, e) I(H)} (we simply write E(v) and V (e) if H is understood). Two vertices v 1, v 2 V (H) are said to be duplicate vertices if E(v 1 ) = E(v 2 ); similarly two edges e 1, e 2 E(H) are said to be duplicate edges if V (e 1 ) = V (e 2 ). A hypergraph is vertex-simple or edge-simple if there are no duplicate vertices or duplicate edges, respectively. While we define a hypergraph as an incidence structure, it is sometimes convenient to consider a hypergraph (particularly an edge-simple one) as a set structure where we identify the edge e with the set V (e). We will at various times consider a hypergraph as a set structure without explicitly making the transition.
3 DISTINGUISHING PARTITIONS 3 An automorphism of a hypergraph H is a pair (π, σ), where π is a permutation of V (H) and σ is a permutation of E(H) such that (v, e) I(H) if and only if (π(v), σ(e)) I(H) for all v V (H) and for all e E(H). The automorphisms of H form a group under composition, denoted Aut H. The image of the projection (π, σ) π is denoted Aut V H, while the image of the projection (π, σ) σ is denoted Aut E H. The members of Aut V H and Aut E H are called vertex automorphisms and edge automorphisms, respectively. If Aut H is the trivial group, we say H is asymmetric. A pair of duplicate vertices or edges gives rise to an automorphism that simply swaps these vertices or edges, so an asymmetric hypergraph is necessarily vertex-simple and edge-simple. The dual of H, denoted H, is a hypergraph (V (H ), E(H ), I(H )), where V (H ) = E(H), E(H ) = V (H), and I(H ) = {(e, v) (v, e) I(H)}. In other words, the dual H swaps the vertices and edges of H. The map (π, σ) Aut H (σ, π) AutH gives rise to the following observation. Observation 2.1. For every hypergraph H, AutH = AutH. Many vertex properties of hypergraphs translate naturally to edge properties using the dual construction. For example, H is n-regular if and only if H is n- uniform, and H is vertex-simple if and only if H is edge-simple. In addition, we have the following lemma. Lemma 2.2. Let H be a hypergraph. (i) If H is edge-simple, then the projection (π, σ) π is an isomorphism from Aut H to Aut V H. (ii) If H is vertex-simple, then the projection (π, σ) σ is an isomorphism from AutH to Aut E H. Proof. (i) We know the given projection is a surjective homomorphism, so it remains to show that it is injective. Assume (π, σ 1 ), (π, σ 2 ) Aut H are two elements that project to π. Since (π, σ 1 ) is an automorphism, we must have V (σ 1 (e)) = π(v (e)) for all e E(H). Similarly we must have V (σ 2 (e)) = π(v (e)) for all e E(H). But this implies V (σ 1 (e)) = V (σ 2 (e)) for all e E(H). Since there are no duplicate edges, this means σ 1 (e) = σ 2 (e) for all e E(H). Hence σ 1 = σ 2, and the projection is injective as desired. (ii) This follows by applying part (i) to H and using Observation 2.1. Suppose we have a function f : X Y. A subset {x 1, x 2,..., x k } X is mapped to the subset {f(x 1 ), f(x 2 ),..., f(x k )} Y. This induces a function f : 2 X 2 Y from subsets of X to subsets of Y. Similarly f induces a function f : 2 2X 2 2Y from collections of subsets of X to collections of subsets of Y. Moreover, if f is injective, then so are f and f. Commonly f and f are just denoted by f, but for our purposes it will be helpful to distinguish between f, f and f. The notation above, together with Lemma 2.2, provides a natural way to talk about automorphisms of a hypergraph as a set structure. If H is an edge-simple hypergraph and (π, σ) Aut H, then we must have σ = π. Additionally, a permutation π of V (H) is an automorphism of H if and only if π (E(H)) = E(H). Equivalently, a permutation π of V (H) is an automorphism of H if and only if π (E(v)) = E(π(v)) for all v V (H). These facts will be useful in the arguments of Section 3.
4 4 M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER Let G be a graph (i.e., 2-uniform hypergraph). If G is simple in the usual sense (i.e., edge-simple) then we will apply Lemma 2.2(i) and consider automorphisms as just permutations of V (G). If uv E(G), we say u and v are adjacent and write u v. A subset of vertices X V (G) is a module if for every v V (G) \ X, either x v for all x X or x v for all x X. If in addition X forms an independent set or clique, then X is called an independent module or complete module, respectively. In general, large independent or complete modules prevent the existence of a distinguishing partition, as shown in the following result. Theorem 2.3. Let G be a graph with V (G) = n. If G contains an independent or complete module X with X > n+1 2, then there exists no distinguishing partition of G. Proof. Assume G has a distinguishing partition. To avoid an automorphism that simply swaps two vertices, each vertex must be in a different set of the partition, and at most one vertex can be in a set by itself. Thus, every other vertex in X must be in a partition with some element not in X, so n 2 X 1. But this implies n+1 2 X, a contradiction. Therefore, no distinguishing partition exists. 3. Reduction to hypergraphs In this section we establish a connection between automorphisms of K m(n) preserving a partition of its vertices and automorphisms of certain hypergraphs. Let [k] denote the set {1, 2,..., k}. The graph K m(n) contains m induced copies of K n, and we can let V (K m(n) ) = [m] [n], where (i, j) denotes the jth vertex in the ith copy of K n. Let ρ : V (K m(n) ) [m] be the projection given by ρ(i, j) = i. In the graph K m(n), any automorphism permutes the m copies of K n along with independently permuting the vertices within each K n. Using the definitions of [3], we see that (after reversing coordinates in V (K m(n) ) = [m] [n]) the action of AutK m(n) is just the wreath product action S n WrS m on the set [n] [m], where S k is the symmetric group acting on [k]. The following theorem formalizes the link between asymmetric hypergraphs and distinguishing partitions of complete equipartite graphs. The idea is to project a partition of V (K m(n) ) using ρ to obtain a hypergraph with vertex set [m], or, conversely, to lift a hypergraph to obtain a partition. Intuitively it is not hard to see that the partition will be distinguishing if and only if the hypergraph is n-regular and asymmetric, but verifying this rigorously requires some technical arguments. Theorem 3.1. The following are equivalent for m, n 1: (i) There exists a distinguishing partition of K m(n). (ii) There exists a distinguishing partition of mk n (the union of m disjoint copies of K n ). (iii) There exists an asymmetric n-regular hypergraph with m vertices. (iv) There exists an asymmetric n-uniform hypergraph with m edges. (v) There exists a distinguishing partition of the wreath product S n WrS m acting on the set [n] [m]. Proof. (i) (ii) This follows because mk n = K m(n) and complementary graphs have the same automorphism group. (i) (iii) Assume S = {S 1, S 2,..., S r } is a distinguishing partition for K m(n). Thus, if α AutK m(n) such that α (S) = S, it follows that α = 1 [m] [n].
5 DISTINGUISHING PARTITIONS 5 For every (i, j) V (K m(n) ), there exists a unique k such that (i, j) S k ; define the function g i (j) = k for all (i, j) V (K m(n) ). If two distinct vertices (i, j 1 ) and (i, j 2 ) both belong to S k then there is an automorphism of K m(n) swapping these two vertices and preserving S, which is a contradiction. Therefore, each function g i is injective. We can define g 1 i (k) precisely when i ρ (S k ), and (i, j) S k k = g i (j) j = g 1 i (k). ( ) Consider the set structure H obtained by setting V (H) = [m] and E(H) = ρ (S). Since each g i is injective, n distinct elements of ρ (S) contain each i [m], and so H is an n-regular hypergraph. We claim that H is edge-simple, i.e., that no two distinct edges are equal as sets. Suppose ρ (S k1 ) = ρ (S k2 ). Then for every (i, j i,1 ) S k1 there exists (i, j i,2 ) S k2. The map that swaps these two elements for all i ρ (S k1 ) forms an automorphism α of K m(n) such that α (S) = S. But this implies α = 1 [m] [n] ; hence, S k1 = S k2 and k 1 = k 2. Thus, H is edge-simple. We want to show that Aut H is trivial; since H is edge-simple, it will suffice to show that Aut V H is trivial. Let π Aut V H. We know π (E(H)) = π (ρ (S)), so we can define the permutation p on [r] by π (ρ (S k )) = ρ (S p(k) ). Set α(i, j) = (π(i), g 1 π(i) (p(g i(j)))). We claim that (1) α is well-defined, (2) ρ α = π ρ, (3) α Aut K m(n), and (4) α (S) = S. For (1), it suffices to show that g 1 π(i) (p(g i(j))) is well-defined. This is true if and only if π(i) ρ (S p(gi(j))) = π (ρ (S gi(j))), which is true if and only if i ρ (S gi(j)). But (i, j) S gi(j) by definition of g i, so this is always true, and α is well-defined. To prove (2), note that ρ α(i, j) = ρ(π(i), g 1 π(i) (p(g i(j)))) = π(i) = π(ρ(i, j)) = π ρ(i, j) for all (i, j) V (K m(n) ). We know π is a permutation of [m], so to verify (3) it suffices to show that j g 1 π(i) (p(g i(j))) is a permutation of [n] for each i [m]. We already know g i, p, and g 1 π(i) are injective, so the composition of these maps is also injective. Since j g 1 π(i) (p(g i(j))) is an injective map from [n] to [n], it must be a permutation. Finally, consider (4). Suppose (i, j) S k. Then α(i, j) = (π(i), g 1 π(i) (p(g i(j)))) = (π(i), g 1 π(i) (p(k))) S p(k), using ( ) twice. Thus, α (S k ) S p(k) for all k. But r k=1 α (S k ) = V (K m(n) ) = r k=1 S p(k), so we must have α (S k ) = S p(k) for all k, and α (S) = S, as required. From (3) and (4) it follows that α = 1 [m] [n], and from (2) we learn that π ρ = ρ α = ρ 1 [m] [n] = ρ. Thus, π(i) = π(ρ(i, j)) = ρ(i, j) = i for all i [m], and hence π = 1 [m]. This shows Aut V H is trivial, as desired. (iii) (i) Assume there is an asymmetric n-regular hypergraph H with V (H) = [m]; we know it must be edge-simple. Let the edges be denoted T 1, T 2,..., T r, and for each i define the distinct numbers g i (1), g i (2),..., g i (n) such that E(i) = {T gi(1), T gi(2),..., T gi(n)}. For each (i, j) [m] [n] replace i in T gi(j) by (i, j); each edge T k now becomes a set S k [m] [n] = V (K m(n) ). Let S = {S 1, S 2,..., S r }; this collection partitions V (K m(n) ). We see that ρ (S k ) = T k for all k [r]. Let α Aut K m(n) be an automorphism such that α (S) = S. We want to show α = 1 [m] [n]. We can write α(i, j) = (π(i), h i (j)), where π is a permutation of [m] and each h i is a permutation of [n]. Then π(ρ(i, j)) = π(i) = ρ(α(i, j)), so that π ρ = ρ α.
6 6 M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER Figure 2. An asymmetric 2-uniform hypergraph with 6 or more edges. Define the permutation p on [r] by α (S k ) = S p(k). For each k, π (T k ) = π (ρ (S k )) = (π ρ) (S k ) = (ρ α) (S k ) = ρ (α (S k )) = ρ (S p(k) ) = T p(k). But then π (E(H)) = E(H), so π Aut V H. By asymmetry of H, this means π = 1 [m]. Thus, p = 1 [r] as well. Now for every (i, j) S k, we have α(i, j) = (π(i), h i (j)) = (i, h i (j)) α (S k ) = S p(k) = S k. However, (i, j), (i, h i (j)) S k implies j = h i (j). It follows that h i = 1 [n] for all i [m], so α = 1 [m] [n]. This shows S is a distinguishing partition for K m(n) as desired. (iii) (iv) This follows from considering the dual hypergraph and Observation 2.1. (i) (v) As discussed above, this action is precisely the automorphism group of K m(n), from which the result follows. Henceforth we consider our problem as in Theorem 3.1(iv), in terms of asymmetric uniform hypergraphs. Note the restriction m 1 in the theorem; this excludes trivial asymmetric uniform hypergraphs with no edges and one or no vertices. From the uniform hypergraph setting we are able to get a lower bound for m. Corollary 3.2. Suppose that m 1 and n 2. If H is an asymmetric n-uniform hypergraph with m edges, then m log 2 n + 1. Proof. Pick any edge f. Since H is asymmetric, it must be vertex-simple, so the sets E(u) must be distinct for all u V (f). For every edge g E(H) \ {f}, either g E(u) or g / E(u). Thus, there are at most 2 m 1 possibilities for E(u). Since they must all be distinct, it follows that n = V (f) 2 m 1. Solving this inequality yields m log 2 n + 1. The following small cases will be needed later in the paper. Theorem 3.3. (i) There are no asymmetric 0- or 1-uniform hypergraphs with 2 or more edges. (ii) There exists an asymmetric 2-uniform hypergraph with m 1 edges if and only if m 6. Proof. (i) This is clear. (ii) An asymmetric 2-uniform hypergraph is simply a graph in the normal sense with a trivial automorphism group. It is not hard to show that every graph with fewer than 6 edges has some nontrivial automorphism. Furthermore, the tree obtained from joining copies of the linear graphs P 2, P 3, and P m 2, m 6, at a common endpoint yields an m-edge graph with trivial automorphism group (see Figure 2).
7 DISTINGUISHING PARTITIONS 7 4. The vertex and edge power complement To define the vertex power complement H V P of an edge-simple hypergraph H, we want to consider H as a set structure, so assume e = V (e) for all e E(H). Let V (H V P ) = V (H), and let E(H V P ) = 2 V (H) \ E(H), where 2 V (H) is the power set of V (H). This yields an edge-simple hypergraph H V P with the same vertex set as H and E(H V P ) = 2 V (H) E(H). Moreover, if H is n-regular, then H V P is (2 V (H) 1 n)-regular. Since H and H V P are edge-simple, we have for any permutation π of V (H) π Aut V H π (E(H)) = E(H) π (E(H V P )) = π (2 V (H) \ E(H)) = 2 V (H) \ E(H) = E(H V P ) π Aut V H V P, which, together with Lemma 2.2(i), leads directly to the following observation. Observation 4.1. For every edge-simple hypergraph H, AutH = Aut V H = Aut V H V P = Aut H V P. We can now define the edge power complement H EP of a vertex-simple hypergraph H by H EP = ((H ) V P ). In other words, we swap the vertices and edges, find the vertex power complement, then reverse the vertices and edges back to their original roles. If we think of our hypergraph in a slightly unusual way, identifying vertices with sets of edges, then V (H EP ) = 2 E(H) \ V (H) and E(H EP ) = E(H). Moreover, if H is n-uniform, then H EP is (2 E(H) 1 n)-uniform. As with the vertex power complement, the edge power complement preserves the automorphism group. Corollary 4.2. For every vertex-simple hypergraph H, Aut H = Aut E H = Aut E H EP = AutH EP. Proof. This follows from Lemma 2.2(ii), Observation 2.1, and Observation 4.1. Example 4.3. H V P and H EP can be represented simply in terms of incidence matrices. Let H be the hypergraph with incidence matrix M(H) below. M(H) = The hypergraph H V P is then given by the incidence matrix M(H V P ) that consists of all binary columns not in M(H). Likewise, the hypergraph H EP is given by the incidence matrix M(H EP ) that consists of all binary rows not in M(H). M(H V P ) = ,M(H EP ) = The usefulness of the edge power complement to us lies in the following corollary. Corollary 4.4. Suppose q 0 and 0 n 2 q. There exists an asymmetric n-uniform hypergraph with q + 1 edges if and only if there exists an asymmetric (2 q n)-uniform hypergraph with q + 1 edges..
8 8 M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER Proof. From Corollary 4.2 we have that H is an asymmetric n-uniform hypergraph with q + 1 edges if and only if H EP is an asymmetric (2 q n)-uniform hypergraph with q + 1 edges. We are now able to improve the lower bound of Corollary 3.2. Corollary 4.5. If m 1, n 3, and H is an asymmetric n-uniform hypergraph with m 1 edges, then m log 2 (n+1) +2. Moreover, if n = 6 then m 5, and if n = 14 then m 6. Proof. We have 2 q n 2 q, with q 2. The bound from Corollary 3.2 is m q + 1, which is identical with the bound here except when n = 2 q or 2 q 1, or 2 q 2 with q = 3 or 4 (i.e., n = 6 or 14). In those cases the bound here is m q + 2, so we must show that H cannot have q + 1 edges. If H did have q + 1 edges then we could apply Corollary 4.4 to obtain a 0-, 1- or 2-uniform asymmetric hypergraph with q + 1 edges, contradicting Theorem Constructions for n = 2 q, 2 q 1, 2 q 2 Corollary 4.4 presents part of an inductive construction for asymmetric uniform hypergraphs. However, Theorem 3.3 leaves some holes in this inductive process, so we will need constructions for n = 2 q and n = 2 q 1 for all q 2. Additionally, we need special constructions for n = 3, 6, and 14. Lemma 5.1. If n = 2 q for q 2, then there exists an asymmetric n-uniform hypergraph with q + 2 edges. Proof. Let V (H) be all possible binary (q + 1)-tuples x = (x 0, x 1, x 2,..., x q ), and set S i = {x V (H) x i = 1}, 0 i q. Let T = S 0 = {x V (H) x 0 = 0}. We have S i = T = 2 q for all i. Furthermore, S i S j = 2 q 1 for all i j, S i T = 2 q 1 for all i 1, and S 0 T = 0. For 1 k q 1, let v(k) T be the vertex with v(k) k = 1 and v(k) l = 0 for all l k; also, let w(k) / T be the vertex with w(k) 0 = 1, w(k) l = 0 for 1 l k 1, and w(k) l = 1 for k l q. Set T = T \ {v(1), v(2),..., v(q 1)} {w(1), w(2),..., w(q 1)}. Set E(H) = {S 0, S 1,..., S q, T }. We claim the set structure H is an asymmetric 2 q -uniform hypergraph with q + 2 edges. The uniformity and size of E(H) are clear from construction. To show there are no automorphisms, we consider each edge s intersection with T. To get from T to T we replaced q 1 vertices with v(k) 0 = 0 with q 1 vertices with w(k) 0 = 1, so that S 0 T = q 1. For i 1, v(k) i = 0 and w(k) i = 1 for 1 k i 1, while v(k) i = w(k) i for k i, so that S i T = 2 q 1 + i 1. Since 2 q 1 + i 1 > q 1 for all i 1 and q 2, the size of the intersection S i T is unique for every edge S i. T is the only edge to have all unique intersection sizes, so any automorphism of H must fix T. But this also fixes every S i according to the size of its intersection with T. Thus, there are no nontrivial edge automorphisms of H. Since H is clearly vertex-simple, by Lemma 2.2(ii) H is asymmetric. Corollary 5.2. If n = 2 q 1 for some integer q 2, then there exists an asymmetric n-uniform hypergraph with q + 2 edges. Proof. In the construction of H above, x = (1, 1,..., 1) is incident with every edge. Thus, removing it creates an edge-simple (2 q 1)-uniform hypergraph H x with
9 DISTINGUISHING PARTITIONS 9 q + 2 edges. Any (vertex) automorphism π of H x can be extended to an automorphism of H by setting π(x) = x, so H x must be asymmetric as well. The construction in Corollary 5.2 is valid when n = 3, but gives a hypergraph with 3 vertices of degree 1. Later we will need a hypergraph with fewer vertices of degree 1. Lemma 5.3. There exist asymmetric hypergraphs H as follows. (i) H is 3-uniform with 4 edges, and 2 vertices of degree 1. (ii) H is 6-uniform with 5 edges. (iii) H is 14-uniform with 6 edges. Proof. For each proof below, the transpose of the incidence matrix, M(H) T, is given. The columns (vertices) are indexed by v 1, v 2,..., v 2n, where n = 3, 6 and 14, respectively, and the rows (edges) are indexed by e 1, e 2,..., e m, where m = 4, 5, and 6, respectively. To prove the induced hypergraph H is asymmetric, the sizes of the edge intersections are provided in a second matrix A = (a ij ), with a ij = e i e j (alternatively, A = M(H) T M(H)). If two rows (edges) e i and e j have a different multiset of intersection sizes, then there can be no (edge) automorphism σ such that σ(e i ) = e j. If all rows of A consist of distinct multisets, then the automorphism group is trivial. This covers parts (ii) and (iii) below, while an additional argument is needed for part (i). (i) M(H) T = , A = From A it might still be possible for an edge automorphism to swap e 1 and e 3. However, e 3 contains a vertex of degree 1, while e 1 does not; thus, no such automorphism exists. Note that v 5 and v 6 are the vertices of degree 1. (ii) (iii) M(H) T = M(H) T = A = ,
10 10 M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER A = , 6. Main result Our overall argument proceeds by induction on n, but for each n we also need to apply induction on m, as provided by the following lemma. Lemma 6.1. Suppose that m 1 and n 2. If there exists an asymmetric n- uniform hypergraph with m edges and at most n 1 vertices of degree 1, then there exists an asymmetric n-uniform hypergraph with m edges for all m m. Proof. Let H be an asymmetric n-uniform hypergraph with m edges and vertices v 1, v 2,..., v k of degree 1, where k n 1. We may assume H has no vertex of degree 0 (any such vertex may be deleted). Form the edge e = {w, v 1, v 2,..., v k, x 1,..., x n k 1 }, where w w / V (H), and the x i s are any other distinct vertices in V (H). The hypergraph H + e contains only one vertex of degree 1, namely w. The edge e containing w must be fixed under any automorphism, and it follows that any edge automorphism of H + e must also be an edge automorphism of H. Thus, the only automorphism of H + e is the trivial one, and we have an asymmetric n-uniform hypergraph with m + 1 edges. Since we now have only one vertex of degree 1, we can repeat this process to get an asymmetric n-uniform hypergraph with m edges for all m m. Remark 6.2. Since a vertex-simple hypergraph with m edges can have at most m vertices of degree 1, the degree 1 requirement holds automatically for m n 1. Theorem 6.3. Let m, n be integers with m 1 and n 2. There exists an asymmetric n-uniform hypergraph with m edges if and only if m f(n), where: 6 if n = 2 5 if n = 6 f(n) = 6 if n = 14 log 2 (n + 1) + 2 if n > 2, n 6, 14 Proof. The case n = 2 is covered by Theorem 3.3(ii). For n 3, applying Corollary 4.5 and Lemma 6.1 means it suffices to find such a hypergraph for m = f(n) with at most n 1 vertices of degree 1. Since f(n) n 1 for all n 5, Remark 6.2 says we can ignore the degree 1 requirement except when n = 3 or 4. We proceed by induction on n. Note that for 3 k n we always have f(k) f(n).
11 DISTINGUISHING PARTITIONS 11 Case 1. If 2 q 1 +1 n 2 q 2 with q 3 and n 6 or 14, then let n = 2 q k with 2 k 2 q 1 1 < n. Since f(k) f(n) (when k = 2 this follows because n 6 or 14), by the inductive assumption there exists an asymmetric k-uniform hypergraph with f(n) = q + 1 edges. Applying Corollary 4.4 provides the desired n-uniform hypergraph. Case 2. The cases n = 6 and 14 follow from Lemma 5.3(ii) and (iii). Case 3. If n = 2 q 1 with q 3, then the result follows from Corollary 5.2. Case 4. If n = 3, then the result follows from Lemma 5.3(i). Case 5. If n = 2 q with q 2, then the result follows from Lemma 5.1. Note that for n = 4 the construction produces only 3 vertices of degree 1. This exhausts all cases and completes the proof. Corollary 6.4. Let m, n be integers with m 1 and n 2, and let f(n) be defined as in Theorem 6.3. (i) There exists a distinguishing partition of K m(n) if and only if m f(n). (ii) There exists a distinguishing partition of mk n if and only if m f(n). (iii) There exists an asymmetric n-regular hypergraph with m vertices if and only if m f(n). (iv) There exists a distinguishing partition for the wreath product S n WrS m acting on [n] [m] if and only if m f(n). Proof. Apply Theorem 3.1 to Theorem Final comments An obvious next step would be to try to extend our main result to other complete multipartite graphs. Dealing with all complete multipartite graphs may be difficult, so it may be sensible to focus on some special classes. If we fix m, there are only finitely many complete m-partite graphs with a distinguishing partition. Arguments similar to those elsewhere in this paper show that a distinguishing partition has at most 2 m 1 parts, and each part has size at most m, so if the total number of vertices is large there cannot be a distinguishing partition. (Better bounds on the number of vertices could be obtained, but we just wish to establish the general idea.) For example, for complete bipartite graphs it is not hard to show the following. Proposition 7.1. The only complete bipartite graph K r,s, 1 r s, with a distinguishing partition is K 1,2. It therefore seems more interesting to look at complete multipartite graphs K n1,n 2,...,n m with arbitrarily large m, but where n 1, n 2,..., n m take only a small number of distinct values. Acknowledgements The first author would like to thank Tom Tucker for helpful conversations, and we thank Melody Chan for providing references [8, 10]. References [1] M. O. Albertson and K. L. Collins, Symmetry breaking in graphs, Electron. J. Combin. 3 (1996), #R18.
12 12 M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER [2] B. Bogstad and L. J. Cowen, The distinguishing number of the hypercube, Discrete Math. 283 (2004), [3] P. J. Cameron, Permutation Groups, in Handbook of Combinatorics, Vol. 1, Elsevier, Amsterdam, 1995, [4] M. Chan, The distinguishing number of the augmented cube and hypercube powers, Discrete Math. 308 (2008), [5] M. Chan, The distinguishing number of the direct product and wreath product action, J. Algebraic Combin. 24 (2006), [6] M. Chan, The maximum distinguishing number of a group, Electron. J. Combin. 13 (2006), #R70. [7] W. Imrich, J. Jerebic, and S. Klavžar, The distinguishing number of Cartesian products of complete graphs, European J. Combin. 29 (2008), [8] S. Klavžar, T.-L. Wong, and X. Zhu, Distinguishing labellings of group action on vector spaces and graphs, J. Algebra 303 (2006), [9] J. Tymoczko, Distinguishing numbers for graphs and groups, Electron. J. Combin. 11 (2004), #R63. [10] T.-L. Wong and X. Zhu, Xuding, Distinguishing labeling of group actions, Discrete Math. 309 (2009), Department of Mathematics, 1326 Stevenson Center, Vanderbilt University, Nashville, TN 37240, USA address, M. N. Ellingham: mark.ellingham@vanderbilt.edu address, Justin Z. Schroeder: justin.z.schroeder@vanderbilt.edu
Distinguishing Cartesian powers of graphs
Distinguishing Cartesian powers of graphs Wilfried Imrich Sandi Klavžar Abstract The distinguishing number D(G) of a graph is the least integer d such that there is a d-labeling of the vertices of G that
More informationUsing Determining Sets to Distinguish Kneser Graphs
Using Determining Sets to Distinguish Kneser Graphs Michael O. Albertson Department of Mathematics and Statistics Smith College, Northampton MA 01063 albertson@math.smith.edu Debra L. Boutin Department
More informationCartesian powers of graphs can be distinguished with two labels
Cartesian powers of graphs can be distinguished with two labels Sandi Klavžar Xuding Zhu Abstract The distinguishing number D(G) of a graph G is the least integer d such that there is a d-labeling of the
More informationSmall Label Classes in 2-Distinguishing Labelings
Also available at http://amc.imfm.si ISSN 1855-3966 (printed ed.), ISSN 1855-3974 (electronic ed.) ARS MATHEMATICA CONTEMPORANEA 1 (2008) 154 164 Small Label Classes in 2-Distinguishing Labelings Debra
More informationEdge colored complete bipartite graphs with trivial automorphism groups
Edge colored complete bipartite graphs with trivial automorphism groups Michael J. Fisher Garth Isaak Abstract We determine the values of s and t for which there is a coloring of the edges of the complete
More informationDistinguishing Chromatic Number of Cartesian Products of Graphs
Graph Packing p.1/14 Distinguishing Chromatic Number of Cartesian Products of Graphs Hemanshu Kaul hkaul@math.uiuc.edu www.math.uiuc.edu/ hkaul/. University of Illinois at Urbana-Champaign Graph Packing
More informationLatin squares: Equivalents and equivalence
Latin squares: Equivalents and equivalence 1 Introduction This essay describes some mathematical structures equivalent to Latin squares and some notions of equivalence of such structures. According to
More informationDistinguishing infinite graphs
Distinguishing infinite graphs Wilfried Imrich Montanuniversität Leoben, A-8700 Leoben, Austria wilfried.imrich@uni-leoben.at Sandi Klavžar Department of Mathematics and Computer Science FNM, University
More informationThe Chromatic Number of Ordered Graphs With Constrained Conflict Graphs
The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs Maria Axenovich and Jonathan Rollin and Torsten Ueckerdt September 3, 016 Abstract An ordered graph G is a graph whose vertex set
More informationarxiv: v1 [math.co] 23 Oct 2016
arxiv:1610.07200v1 [math.co] 23 Oct 2016 Distinguishing number and distinguishing index of Kronecker product of two graphs Saeid Alikhani February 1, 2018 Samaneh Soltani Department of Mathematics, Yazd
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 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 informationDecomposing oriented graphs into transitive tournaments
Decomposing oriented graphs into transitive tournaments Raphael Yuster Department of Mathematics University of Haifa Haifa 39105, Israel Abstract For an oriented graph G with n vertices, let f(g) denote
More informationTrees with distinguishing index equal distinguishing number plus one
Trees with distinguishing index equal distinguishing number plus one Saeid Alikhani a, Sandi Klavžar b,c,d Florian Lehner e Samaneh Soltani a July 4, 2018 a Department of Mathematics, Yazd University,
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 informationThe chromatic number of ordered graphs with constrained conflict graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 69(1 (017, Pages 74 104 The chromatic number of ordered graphs with constrained conflict graphs Maria Axenovich Jonathan Rollin Torsten Ueckerdt Department
More informationDistinguishing infinite graphs
Distinguishing infinite graphs Wilfried Imrich Montanuniversität Leoben, A-8700 Leoben, Austria wilfried.imrich@mu-leoben.at Sandi Klavžar Department of Mathematics and Computer Science FNM, University
More informationClassical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems
Classical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems Rani M. R, Mohith Jagalmohanan, R. Subashini Binary matrices having simultaneous consecutive
More informationMathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations
Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations D. R. Wilkins Academic Year 1996-7 1 Number Systems and Matrix Algebra Integers The whole numbers 0, ±1, ±2, ±3, ±4,...
More informationSome hard families of parameterised counting problems
Some hard families of parameterised counting problems Mark Jerrum and Kitty Meeks School of Mathematical Sciences, Queen Mary University of London {m.jerrum,k.meeks}@qmul.ac.uk September 2014 Abstract
More informationDISTINGUISHING CARTESIAN PRODUCTS OF COUNTABLE GRAPHS
Discussiones Mathematicae Graph Theory 37 (2017) 155 164 doi:10.7151/dmgt.1902 DISTINGUISHING CARTESIAN PRODUCTS OF COUNTABLE GRAPHS Ehsan Estaji Hakim Sabzevari University, Sabzevar, Iran e-mail: ehsan.estaji@hsu.ac.ir
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 informationAn approximate version of Hadwiger s conjecture for claw-free graphs
An approximate version of Hadwiger s conjecture for claw-free graphs Maria Chudnovsky Columbia University, New York, NY 10027, USA and Alexandra Ovetsky Fradkin Princeton University, Princeton, NJ 08544,
More informationParity Versions of 2-Connectedness
Parity Versions of 2-Connectedness C. Little Institute of Fundamental Sciences Massey University Palmerston North, New Zealand c.little@massey.ac.nz A. Vince Department of Mathematics University of Florida
More information--------------------------------------------------------------------------------------------- Math 6023 Topics: Design and Graph Theory ---------------------------------------------------------------------------------------------
More informationGeneralized covering designs and clique coverings
Generalized covering designs and clique coverings Robert F. Bailey, Andrea C. Burgess, Michael S. Cavers, Karen Meagher March 14, 2011 Abstract Inspired by the generalized t-designs defined by Cameron
More informationOn the Effectiveness of Symmetry Breaking
On the Effectiveness of Symmetry Breaking Russell Miller 1, Reed Solomon 2, and Rebecca M Steiner 3 1 Queens College and the Graduate Center of the City University of New York Flushing NY 11367 2 University
More informationGALOIS THEORY BRIAN OSSERMAN
GALOIS THEORY BRIAN OSSERMAN Galois theory relates the theory of field extensions to the theory of groups. It provides a powerful tool for studying field extensions, and consequently, solutions to polynomial
More informationEven Cycles in Hypergraphs.
Even Cycles in Hypergraphs. Alexandr Kostochka Jacques Verstraëte Abstract A cycle in a hypergraph A is an alternating cyclic sequence A 0, v 0, A 1, v 1,..., A k 1, v k 1, A 0 of distinct edges A i and
More informationEdge-counting vectors, Fibonacci cubes, and Fibonacci triangle
Publ. Math. Debrecen Manuscript (November 16, 2005) Edge-counting vectors, Fibonacci cubes, and Fibonacci triangle By Sandi Klavžar and Iztok Peterin Abstract. Edge-counting vectors of subgraphs of Cartesian
More informationDistinguishing Cartesian Products of Countable Graphs
MATEMATYKA DYSKRETNA www.ii.uj.edu.pl/premd/ Ehsan ESTAJI, Wilfried IMRICH, Rafa l KALINOWSKI, Monika PILŚNIAK Distinguishing Cartesian Products of Countable Graphs Preprint Nr MD 079 (otrzymany dnia 1.09.2015)
More informationHanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS
Opuscula Mathematica Vol. 6 No. 006 Hanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS Abstract. A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a
More informationLocal finiteness, distinguishing numbers, and Tucker s conjecture
Local finiteness, distinguishing numbers, and Tucker s conjecture Florian Lehner Department of Mathematics University of Hamburg Hamburg, Germany mail@florian-lehner.net Rögnvaldur G. Möller School of
More informationBulletin of the Iranian Mathematical Society
ISSN: 117-6X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Mathematical Society Vol. 4 (14), No. 6, pp. 1491 154. Title: The locating chromatic number of the join of graphs Author(s): A. Behtoei
More informationGenerating p-extremal graphs
Generating p-extremal graphs Derrick Stolee Department of Mathematics Department of Computer Science University of Nebraska Lincoln s-dstolee1@math.unl.edu August 2, 2011 Abstract Let f(n, p be the maximum
More informationPigeonhole Principle and Ramsey Theory
Pigeonhole Principle and Ramsey Theory The Pigeonhole Principle (PP) has often been termed as one of the most fundamental principles in combinatorics. The familiar statement is that if we have n pigeonholes
More informationDistinguishing Number of Countable Homogeneous Relational Structures
Distinguishing Number of Countable Homogeneous Relational Structures C. Laflamme University of Calgary Department of Mathematics and Statistics 2500 University Dr. NW. Calgary Alberta Canada T2N1N4 L.
More informationGroup Colorability of Graphs
Group Colorability of Graphs Hong-Jian Lai, Xiankun Zhang Department of Mathematics West Virginia University, Morgantown, WV26505 July 10, 2004 Abstract Let G = (V, E) be a graph and A a non-trivial Abelian
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationA Questionable Distance-Regular Graph
A Questionable Distance-Regular Graph Rebecca Ross Abstract In this paper, we introduce distance-regular graphs and develop the intersection algebra for these graphs which is based upon its intersection
More informationOn a Conjecture of Thomassen
On a Conjecture of Thomassen Michelle Delcourt Department of Mathematics University of Illinois Urbana, Illinois 61801, U.S.A. delcour2@illinois.edu Asaf Ferber Department of Mathematics Yale University,
More informationUNAVOIDABLE INDUCED SUBGRAPHS IN LARGE GRAPHS WITH NO HOMOGENEOUS SETS
UNAVOIDABLE INDUCED SUBGRAPHS IN LARGE GRAPHS WITH NO HOMOGENEOUS SETS MARIA CHUDNOVSKY, RINGI KIM, SANG-IL OUM, AND PAUL SEYMOUR Abstract. An n-vertex graph is prime if it has no homogeneous set, that
More informationARTICLE IN PRESS European Journal of Combinatorics ( )
European Journal of Combinatorics ( ) Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Proof of a conjecture concerning the direct
More informationChromatic Ramsey number of acyclic hypergraphs
Chromatic Ramsey number of acyclic hypergraphs András Gyárfás Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences Budapest, P.O. Box 127 Budapest, Hungary, H-1364 gyarfas@renyi.hu Alexander
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 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 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 education use, including for instruction at the authors institution
More informationContainment restrictions
Containment restrictions Tibor Szabó Extremal Combinatorics, FU Berlin, WiSe 207 8 In this chapter we switch from studying constraints on the set operation intersection, to constraints on the set relation
More informationInduced Saturation of Graphs
Induced Saturation of Graphs Maria Axenovich a and Mónika Csikós a a Institute of Algebra and Geometry, Karlsruhe Institute of Technology, Englerstraße 2, 76128 Karlsruhe, Germany Abstract A graph G is
More informationK 4 -free graphs with no odd holes
K 4 -free graphs with no odd holes Maria Chudnovsky 1 Columbia University, New York NY 10027 Neil Robertson 2 Ohio State University, Columbus, Ohio 43210 Paul Seymour 3 Princeton University, Princeton
More informationStrongly Regular Decompositions of the Complete Graph
Journal of Algebraic Combinatorics, 17, 181 201, 2003 c 2003 Kluwer Academic Publishers. Manufactured in The Netherlands. Strongly Regular Decompositions of the Complete Graph EDWIN R. VAN DAM Edwin.vanDam@uvt.nl
More informationIndependent Transversals in r-partite Graphs
Independent Transversals in r-partite Graphs Raphael Yuster Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract Let G(r, n) denote
More informationMULTIPLICITIES OF MONOMIAL IDEALS
MULTIPLICITIES OF MONOMIAL IDEALS JÜRGEN HERZOG AND HEMA SRINIVASAN Introduction Let S = K[x 1 x n ] be a polynomial ring over a field K with standard grading, I S a graded ideal. The multiplicity of S/I
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 informationBoolean Inner-Product Spaces and Boolean Matrices
Boolean Inner-Product Spaces and Boolean Matrices Stan Gudder Department of Mathematics, University of Denver, Denver CO 80208 Frédéric Latrémolière Department of Mathematics, University of Denver, Denver
More informationColoring Vertices and Edges of a Path by Nonempty Subsets of a Set
Coloring Vertices and Edges of a Path by Nonempty Subsets of a Set P.N. Balister E. Győri R.H. Schelp November 8, 28 Abstract A graph G is strongly set colorable if V (G) E(G) can be assigned distinct
More informationHW Graph Theory SOLUTIONS (hbovik) - Q
1, Diestel 3.5: Deduce the k = 2 case of Menger s theorem (3.3.1) from Proposition 3.1.1. Let G be 2-connected, and let A and B be 2-sets. We handle some special cases (thus later in the induction if these
More informationOn Hadamard Diagonalizable Graphs
On Hadamard Diagonalizable Graphs S. Barik, S. Fallat and S. Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A2 Abstract Of interest here is a characterization
More informationAUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS
AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS MAX GOLDBERG Abstract. We explore ways to concisely describe circulant graphs, highly symmetric graphs with properties that are easier to generalize
More informationMath 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008
Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Closed sets We have been operating at a fundamental level at which a topological space is a set together
More informationClassification of root systems
Classification of root systems September 8, 2017 1 Introduction These notes are an approximate outline of some of the material to be covered on Thursday, April 9; Tuesday, April 14; and Thursday, April
More informationχ D (G), Aut(G), and a variant of the Motion Lemma
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 1 (017) 89 109 χ D (G), Aut(G), and a variant of the Motion Lemma Niranjan
More informationClaw-free Graphs. III. Sparse decomposition
Claw-free Graphs. III. Sparse decomposition Maria Chudnovsky 1 and Paul Seymour Princeton University, Princeton NJ 08544 October 14, 003; revised May 8, 004 1 This research was conducted while the author
More informationQuivers of Period 2. Mariya Sardarli Max Wimberley Heyi Zhu. November 26, 2014
Quivers of Period 2 Mariya Sardarli Max Wimberley Heyi Zhu ovember 26, 2014 Abstract A quiver with vertices labeled from 1,..., n is said to have period 2 if the quiver obtained by mutating at 1 and then
More informationA Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits Ran Raz Amir Shpilka Amir Yehudayoff Abstract We construct an explicit polynomial f(x 1,..., x n ), with coefficients in {0,
More informationToughness and prism-hamiltonicity of P 4 -free graphs
Toughness and prism-hamiltonicity of P 4 -free graphs M. N. Ellingham Pouria Salehi Nowbandegani Songling Shan Department of Mathematics, 1326 Stevenson Center, Vanderbilt University, Nashville, TN 37240
More informationGraph Minor Theory. Sergey Norin. March 13, Abstract Lecture notes for the topics course on Graph Minor theory. Winter 2017.
Graph Minor Theory Sergey Norin March 13, 2017 Abstract Lecture notes for the topics course on Graph Minor theory. Winter 2017. Contents 1 Background 2 1.1 Minors.......................................
More informationBuilding Graphs from Colored Trees
Building Graphs from Colored Trees Rachel M. Esselstein CSUMB Department of Mathematics and Statistics 100 Campus Center Dr. Building 53 Seaside, CA 93955, U.S.A. resselstein@csumb.edu Peter Winkler Department
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 informationFinite Induced Graph Ramsey Theory: On Partitions of Subgraphs
inite Induced Graph Ramsey Theory: On Partitions of Subgraphs David S. Gunderson and Vojtěch Rödl Emory University, Atlanta GA 30322. Norbert W. Sauer University of Calgary, Calgary, Alberta, Canada T2N
More informationIsomorphisms between pattern classes
Journal of Combinatorics olume 0, Number 0, 1 8, 0000 Isomorphisms between pattern classes M. H. Albert, M. D. Atkinson and Anders Claesson Isomorphisms φ : A B between pattern classes are considered.
More informationGraph Classes and Ramsey Numbers
Graph Classes and Ramsey Numbers Rémy Belmonte, Pinar Heggernes, Pim van t Hof, Arash Rafiey, and Reza Saei Department of Informatics, University of Bergen, Norway Abstract. For a graph class G and any
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 informationBichain graphs: geometric model and universal graphs
Bichain graphs: geometric model and universal graphs Robert Brignall a,1, Vadim V. Lozin b,, Juraj Stacho b, a Department of Mathematics and Statistics, The Open University, Milton Keynes MK7 6AA, United
More informationColoring Vertices and Edges of a Path by Nonempty Subsets of a Set
Coloring Vertices and Edges of a Path by Nonempty Subsets of a Set P.N. Balister E. Győri R.H. Schelp April 28, 28 Abstract A graph G is strongly set colorable if V (G) E(G) can be assigned distinct nonempty
More informationMaximal Independent Sets In Graphs With At Most r Cycles
Maximal Independent Sets In Graphs With At Most r Cycles Goh Chee Ying Department of Mathematics National University of Singapore Singapore goh chee ying@moe.edu.sg Koh Khee Meng Department of Mathematics
More informationPosets, homomorphisms and homogeneity
Posets, homomorphisms and homogeneity Peter J. Cameron and D. Lockett School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, U.K. Abstract Jarik Nešetřil suggested
More informationCographs; chordal graphs and tree decompositions
Cographs; chordal graphs and tree decompositions Zdeněk Dvořák September 14, 2015 Let us now proceed with some more interesting graph classes closed on induced subgraphs. 1 Cographs The class of cographs
More informationExtremal Graphs Having No Stable Cutsets
Extremal Graphs Having No Stable Cutsets Van Bang Le Institut für Informatik Universität Rostock Rostock, Germany le@informatik.uni-rostock.de Florian Pfender Department of Mathematics and Statistics University
More informationBASIC GROUP THEORY : G G G,
BASIC GROUP THEORY 18.904 1. Definitions Definition 1.1. A group (G, ) is a set G with a binary operation : G G G, and a unit e G, possessing the following properties. (1) Unital: for g G, we have g e
More informationThe decomposability of simple orthogonal arrays on 3 symbols having t + 1 rows and strength t
The decomposability of simple orthogonal arrays on 3 symbols having t + 1 rows and strength t Wiebke S. Diestelkamp Department of Mathematics University of Dayton Dayton, OH 45469-2316 USA wiebke@udayton.edu
More informationFRACTIONAL FACTORIAL DESIGNS OF STRENGTH 3 AND SMALL RUN SIZES
FRACTIONAL FACTORIAL DESIGNS OF STRENGTH 3 AND SMALL RUN SIZES ANDRIES E. BROUWER, ARJEH M. COHEN, MAN V.M. NGUYEN Abstract. All mixed (or asymmetric) orthogonal arrays of strength 3 with run size at most
More informationON THE ORDER OF ARC-STABILISERS IN ARC-TRANSITIVE GRAPHS, II
Bull. Aust. Math. Soc. 87 (2013), 441 447 doi:10.1017/s0004972712000470 ON THE ORDER OF ARC-STABILISERS IN ARC-TRANSITIVE GRAPHS, II GABRIEL VERRET (Received 30 April 2012; accepted 11 May 2012; first
More informationOn cordial labeling of hypertrees
On cordial labeling of hypertrees Michał Tuczyński, Przemysław Wenus, and Krzysztof Węsek Warsaw University of Technology, Poland arxiv:1711.06294v3 [math.co] 17 Dec 2018 December 19, 2018 Abstract Let
More informationIndependent generating sets and geometries for symmetric groups
Independent generating sets and geometries for symmetric groups Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS UK Philippe Cara Department
More informationON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2. Bert L. Hartnell
Discussiones Mathematicae Graph Theory 24 (2004 ) 389 402 ON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2 Bert L. Hartnell Saint Mary s University Halifax, Nova Scotia, Canada B3H 3C3 e-mail: bert.hartnell@smu.ca
More informationEndomorphism Breaking in Graphs
Endomorphism Breaking in Graphs Wilfried Imrich Montanuniversität Leoben, A-8700 Leoben, Austria imrich@unileoben.ac.at Rafa l Kalinowski AGH University of Science and Technology, al. Mickiewicza 30, 30-059
More informationDef. A topological space X is disconnected if it admits a non-trivial splitting: (We ll abbreviate disjoint union of two subsets A and B meaning A B =
CONNECTEDNESS-Notes Def. A topological space X is disconnected if it admits a non-trivial splitting: X = A B, A B =, A, B open in X, and non-empty. (We ll abbreviate disjoint union of two subsets A and
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 informationInduced Subgraph Isomorphism on proper interval and bipartite permutation graphs
Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs Pinar Heggernes Pim van t Hof Daniel Meister Yngve Villanger Abstract Given two graphs G and H as input, the Induced Subgraph
More informationMinimal Paths and Cycles in Set Systems
Minimal Paths and Cycles in Set Systems Dhruv Mubayi Jacques Verstraëte July 9, 006 Abstract A minimal k-cycle is a family of sets A 0,..., A k 1 for which A i A j if and only if i = j or i and j are consecutive
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh 27 June 2008 1 Warm-up 1. (A result of Bourbaki on finite geometries, from Răzvan) Let X be a finite set, and let F be a family of distinct proper subsets
More informationORTHOGONAL ARRAYS OF STRENGTH 3 AND SMALL RUN SIZES
ORTHOGONAL ARRAYS OF STRENGTH 3 AND SMALL RUN SIZES ANDRIES E. BROUWER, ARJEH M. COHEN, MAN V.M. NGUYEN Abstract. All mixed (or asymmetric) orthogonal arrays of strength 3 with run size at most 64 are
More informationRECOGNIZING WEIGHTED DIRECTED CARTESIAN GRAPH BUNDLES
Discussiones Mathematicae Graph Theory 20 (2000 ) 39 56 RECOGNIZING WEIGHTED DIRECTED CARTESIAN GRAPH BUNDLES Blaž Zmazek Department of Mathematics, PEF, University of Maribor Koroška 160, si-2000 Maribor,
More informationParameterizing orbits in flag varieties
Parameterizing orbits in flag varieties W. Ethan Duckworth April 2008 Abstract In this document we parameterize the orbits of certain groups acting on partial flag varieties with finitely many orbits.
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 informationMATH 2200 Final LC Review
MATH 2200 Final LC Review Thomas Goller April 25, 2013 1 Final LC Format The final learning celebration will consist of 12-15 claims to be proven or disproven. It will take place on Wednesday, May 1, from
More informationNear-domination in graphs
Near-domination in graphs Bruce Reed Researcher, Projet COATI, INRIA and Laboratoire I3S, CNRS France, and Visiting Researcher, IMPA, Brazil Alex Scott Mathematical Institute, University of Oxford, Oxford
More informationAn algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
Also available at http://amc-journal.eu ISSN 855-3966 (printed edn.), ISSN 855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 2 (207) 205 27 An algebraic proof of the Erdős-Ko-Rado theorem for intersecting
More informationarxiv: v1 [math.gr] 7 Jan 2019
The ranks of alternating string C-groups Mark Mixer arxiv:1901.01646v1 [math.gr] 7 Jan 019 January 8, 019 Abstract In this paper, string C-groups of all ranks 3 r < n are provided for each alternating
More information