On Optimal Orientations of Cartesian Products of Trees

. Let d(D) (resp., d(G)) denote the diameter and r(D) (resp., r(G)) the radius of a digraph D (resp., graph G). Let G×H denote the cartesian product of two graphs G and H. An orientation D of G is said to be (r, d)-invariant if r(D)=r(G) and d(D)=d(G). Let {T _i }, i=1,…,n, where n≥2, be a family of trees. In this paper, we show that the graph ∏ _{i =1} ⁿ T _i admits an (r, d)-invariant orientation provided that d(T ₁)≥d(T ₂)≥4 for n=2, and d(T ₁)≥5 and d(T ₂)≥4 for n≥3. Received: July 30, 1997 Final version received: April 20, 1998     

A Property About Minimum Edge- and Minimum Clique-Cover of a Graph

 Let G be a graph with n vertices, and denote as γ(G) (as θ(G)) the cardinality of a minimum edge cover (of a minimum clique cover) of G. Let E (let C) be the edge-vertex (the clique-vertex) incidence matrix of G; write then P(E)={x∈ℜ ⁿ :Ex≤1,x≥0}, P(C)={x∈ℜ ⁿ :Cx≤1,x≥0}, α _E (G)=max{1 ^T x subject to x∈P(E)}, and α _C (G)= max{1 ^T x subject to x∈P(C)}. In this paper we prove that if α _E (G)=α _C (G), then γ(G)=θ(G). Received: May 20, 1998?Final version received: April 12, 1999     

Structure of augmentation quotients of finite homocyclic abelian groups

Let G be a finite abelian group and its Sylow p-subgroup a direct product of copies of a cyclic group of order p~r,i.e.,a finite homocyclic abelian group.LetΔ~n (G) denote the n-th power of the augmentation idealΔ(G) of the integral group ring ZG.The paper gives an explicit structure of the consecutive quotient group Q_n(G)=Δ~n(G)/Δ~(n 1)(G) for any natural number n and as a consequence settles a problem of Karpilovsky for this particular class of finite abelian groups.     

Large Monotone Paths in Graphs with Bounded Degree

 We prove that for every ε>0 and positive integer r, there exists Δ₀=Δ₀(ε) such that if Δ>Δ₀ and n>n(Δ,ε,r) then there exists a packing of K _n with ⌊(n−1)/Δ⌋ graphs, each having maximum degree at most Δ and girth at least r, where at most εn ² edges are unpacked. This result is used to prove the following: Let f be an assignment of real numbers to the edges of a graph G. Let α(G,f) denote the maximum length of a monotone simple path of G with respect to f. Let α(G) be the minimum of α(G,f), ranging over all possible assignments. Now let α_Δ be the maximum of α(G) ranging over all graphs with maximum degree at most Δ. We prove that Δ+1≥α_Δ≥Δ(1−o(1)). This extends some results of Graham and Kleitman [6] and of Calderbank et al. [4] who considered α(K _n ). Received: March 15, 1999?Final version received: October 22, 1999     

Total colorings of graphs of order 2n having maximum degree 2n−2

Let χ _t (G) and †(G) denote respectively the total chromatic number and maximum degree of graphG. Yap, Wang and Zhang proved in 1989 that ifG is a graph of orderp having †(G)≥p−4, then χ _t (G≤Δ(G)+2. Hilton has characterized the class of graphG of order 2n having †(G)=2n−1 such that χ _t (G=Δ(G)+2. In this paper, we characterize the class of graphsG of order 2n having †(G)=2n−2 such that χ _t (G=Δ(G)+2 Research supported by National Science Council of the Republic of China (NSC 79-0208-M009-15)     

On the limit of large girth graph sequences

Let d≥2 be given and let μ be an involution-invariant probability measure on the space of trees T ∈ T _d with maximum degrees at most d. Then μ arises as the local limit of some sequence {G _n } _n=1^∞ of graphs with all degrees at most d. This answers Question 3.3 of Bollobás and Riordan [4].     

On subgroups of the general linear group that contain a maximal nonsplit torus

The paper deals with the structure of intermediate subgroups of the general linear group GL(n, k) of degree n over a field k of odd characteristic that contain a nonsplit maximal torus related to a radical extension of degree n of the ground field k. The structure of ideal nets over a ring that determine the structure of intermediate subgroups containinga transvection is given. Let K = k( ⁿ?{d} ) K = k\left( {\sqrt[n]{d}} \right) be a radical degree-n extension of a field k of odd characteristic, and let T =(d) be a nonsplit maximal torus, which is the image of the multiplicative group of the field K under the regular embedding in G =GL(n, k). In the paper, the structure of intermediate subgroups H, T ≤ H ≤ G, that contain a transvection is studied. The elements of the matrices in the torus T = T (d) generate a subring R(d) in the field k.Let R be an intermediate subring, R(d) ⊆ R ⊆ k, d ∈ R. Let σ_R denote the net in which the ideal dR stands on the principal diagonal and above it and all entries of which beneath the principal diagonal are equal to R. Let σ^R denote the net in which all positions on the principal diagonal and beneath it are occupied by R and all entries above the principal diagonal are equal to dR. Let E(σ_R) be the subgroup generated by all transvections from the net group G(σ_R). In the paper it is proved that the product TE(σ_R) is a group (and thus an intermediate subgroup). If the net σ associated with an intermediate subgroup H coincides with σ_R,then TE(σ_R) ≤ H ≤ N(σ_R),where N(σ_R) is the normalizer of the elementary net group E(σ_R) in G. For the normalizer N(σ_R),the formula N(σ_R)= TG(σ^R) holds. In particular, this result enables one to describe the maximal intermediate subgroups. Bibliography: 13 titles.     

T-Colorings and T-Edge Spans of Graphs

 Suppose G is a graph and T is a set of non-negative integers that contains 0. A T-coloring of G is an assignment of a non-negative integer f(x) to each vertex x of G such that |f(x)−f(y)|∉T whenever xy∈E(G). The edge span of a T-coloring−f is the maximum value of |f(x) f(y)| over all edges xy, and the T-edge span of a graph G is the minimum value of the edge span of a T-coloring of G. This paper studies the T-edge span of the dth power C ^d _n of the n-cycle C _n for T={0, 1, 2, …, k−1}. In particular, we find the exact value of the T-edge span of C _n ^d for n≡0 or (mod d+1), and lower and upper bounds for other cases. Received: May 13, 1996 Revised: December 8, 1997     

Some results on distance two labelling of outerplanar graphs

Let G be an outerplanar graph with maximum degree △. Let χ（G^2） and A（G） denote the chromatic number of the square and the L（2, 1）-labelling number of G, respectively. In this paper we prove the following results： （1） χ（G^2） = 7 if △= 6; （2） λ（G） ≤ △ ＋5 if △ ≥ 4, and ）,（G）≤ 7 if △ = 3; and （3） there is an outerplanar graph G with △ = 4 such that ）λ（G） = 7. These improve some known results on the distance two labelling of outerplanar graphs.     

Embeddings ofl p m intol ∞ n , 1≦p≦2

Isomorphic embeddings ofl _l ^m intol _∞ ⁿ are studied, and ford(n, k)=inf{‖T ‖ ‖T ⁻¹ ‖;T varies over all isomorphic embeddings ofl ₁ ^[klog2n] intol _∞ ⁿ we have that lim _n→∞ d(n, k)=γ(k)⁻¹,k>1, whereγ(k) is the solution of (1+γ)ln(1+γ)+(1 −γ)ln(1 −γ)=k ⁻¹ln4. Here [x] denotes the integer part of the real numberx.     

Thed-step conjecture for polyhedra of dimensiond<6

Two functions Δ and Δ _b , of interest in combinatorial geometry and the theory of linear programming, are defined and studied. Δ(d, n) is the maximum diameter of convex polyhedra of dimensiond withn faces of dimensiond−1; similarly, Δ _b (d,n) is the maximum diameter of bounded polyhedra of dimensiond withn faces of dimensiond−1. The diameter of a polyhedronP is the smallest integerl such that any two vertices ofP can be joined by a path ofl or fewer edges ofP. It is shown that the boundedd-step conjecture, i.e. Δ _b (d,2d)=d, is true ford≤5. It is also shown that the generald-step conjecture, i.e. Δ(d, 2d)≤d, of significance in linear programming, is false ford≥4. A number of other specific values and bounds for Δ and Δ _b are presented. This revised version was published online in November 2006 with corrections to the Cover Date.     

On convolution powers on semidirect products

LetK be a compact group of linear operators of thed-dimensional spaceR ^d andG _K,d denote the semidirect productK byR ^d . It is shown that if an adapted probability measureμ onG _K,d is not scattered (i.e. for some compactF we havex ₀ ∈ R ^d (gF)>0), then there exists a nonzero vectorx ₀ ∈R ^d such thatk ₁(x ₀)=k ₂(x ₀) holds for all (k ₁,x ₁) and (k ₂,x ₂) belonging to the topological supportS(μ) of the measureμ. As a result we obtain that every adapted and strictly aperiodic probability measure on the group of all rigid motions of thed-dimensional Euclidian space is scattered. I thank the Foundation for Research Development for financial support.     

On the structure of the augmentation quotient group for some nonabelian 2-groups

Let G be a finite nonabelian group, ℤG its associated integral group ring, and Δ(G) its augmentation ideal. For the semidihedral group and another nonabelian 2-group the problem of their augmentation ideals and quotient groups Q _n (G) = Δ ⁿ (G)/Δ ⁿ⁺¹(G) is deal with. An explicit basis for the augmentation ideal is obtained, so that the structure of its quotient groups can be determined.     

An Ore-type analogue of the Sauer-Spencer Theorem

Two graphs G₁ and G₂ of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets do not intersect. Sauer and Spencer proved that if Δ (G₁) Δ (G₂) < 0.5n, then G₁ and G₂ pack. In this note, we study an Ore-type analogue of the Sauer–Spencer Theorem. Let θ(G) = max{d(u) + d(v): uv∈E(G)}. We show that if θ(G₁)Δ(G₂) < n, then G₁ and G₂ pack. We also characterize the pairs (G₁,G₂) of n-vertex graphs satisfying θ(G₁)Δ(G₂) = n that do not pack. This work was supported in part by NSF grant DMS-0400498. The work of the first author was also partly supported by grant 05-01-00816 of the Russian Foundation for Basic Research.     

Trees with Equal Domination and Restrained Domination Numbers

Let G = (V,E) be a graph and let S V. The set S is a packing in G if the vertices of S are pairwise at distance at least three apart in G. The set S is a dominating set (DS) if every vertex in V − S is adjacent to a vertex in S. Further, if every vertex in V − S is also adjacent to a vertex in V − S, then S is a restrained dominating set (RDS). The domination number of G, denoted by γ(G), is the minimum cardinality of a DS of G, while the restrained domination number of G, denoted by γ_r(G), is the minimum cardinality of a RDS of G. The graph G is γ-excellent if every vertex of G belongs to some minimum DS of G. A constructive characterization of trees with equal domination and restrained domination numbers is presented. As a consequence of this characterization we show that the following statements are equivalent: (i) T is a tree with γ(T)=γ_r(T); (ii) T is a γ-excellent tree and T ≠ K₂; and (iii) T is a tree that has a unique maximum packing and this set is a dominating set of T. We show that if T is a tree of order n with ℓ leaves, then γ_r(T) ≤ (n + ℓ + 1)/2, and we characterize those trees achieving equality.     

Upper bounds for the diameter and height of graphs of convex polyhedra

Let Δ(d, n) be the maximum diameter of the graph of ad-dimensional polyhedronP withn-facets. It was conjectured by Hirsch in 1957 that Δ(d, n) depends linearly onn andd. However, all known upper bounds for Δ(d, n) were exponential ind. We prove a quasi-polynomial bound Δ(d, n)≤n ^{2 logd+3}. LetP be ad-dimensional polyhedron withn facets, let ϕ be a linear objective function which is bounded onP and letv be a vertex ofP. We prove that in the graph ofP there exists a monotone path leading fromv to a vertex with maximal ϕ-value whose length is at most . This research was supported in part by a BSF grant, by a GIF grant, and by ONR-N00014-91-C0026.     

A simple map with no prime factors

An ergodic measure-preserving transformationT of a probability space is said to be simple (of order 2) if every ergodic joining λ ofT with itself is eitherμ×μ or an off-diagonal measureμ _S , i.e.,μ _S (A×B)=μ(A∩S ^;−n ;B) for some invertible, measure preservingS commuting withT. Veech proved that ifT is simple thenT is a group extension of any of its non-trivial factors. Here we construct an example of a weakly mixing simpleT which has no prime factors. This is achieved by constructing an action of the countable Abelian group ℤ⊕G, whereG=⊕ _i=1 ^∞ ℤ₂, such that the ℤ-subaction is simple and has centralizer coinciding with the full ℤ⊕G-action.     

The size-Ramsey number of trees

IfG andH are graphs, let us writeG→(H)₂ ifG contains a monochromatic copy ofH in any 2-colouring of the edges ofG. Thesize-Ramsey number r _e(H) of a graphH is the smallest possible number of edges a graphG may have ifG→(H)₂. SupposeT is a tree of order |T|≥2, and lett ₀,t ₁ be the cardinalities of the vertex classes ofT as a bipartite graph, and let Δ(T) be the maximal degree ofT. Moreover, let Δ₀, Δ₁ be the maxima of the degrees of the vertices in the respective vertex classes, and letβ(T)=T ₀Δ₀+t ₁Δ₁. Beck [7] proved thatβ(T)/4≤r _e(T)=O{β(T)(log|T|)¹²}, improving on a previous result of his [6] stating thatr _e(T)≤Δ(T)|T|(log|T|)¹². In [6], Beck conjectures thatr _e(T)=O{Δ(T)|T|}, and in [7] he puts forward the stronger conjecture thatr _e(T)=O{β(T)}. Here, we prove the first of these conjectures, and come quite close to proving the second by showing thatr _e(T)=O{β(T)logΔ(T)}.