Scale functions on $p$-adic Lie groups

Let G be a p-adic Lie group. Then G is a locally compact, totally disconnected group, to which Willis [14] associates its scale function G : G→ℕ. We show that s can be computed on the Lie algebra level. The image of s consists of powers of p. If G is a linear algebraic group over ℚ _p , s(x)=s(h) is determined by the semisimple part h of x∈G. For every finite extension K of ℚ _p , the scale functions of G and H:=G(K) are related by s _H ∣ _G =s _G ^{[ K :ℚ} _p ^]. More generally, we clarify the relations between the scale function of a p-adic Lie group and the scale functions of its closed subgroups and Hausdorff quotients. Received: 20 February 1997; Revised version: 18 May 1998     

Hamilton cycles and closed trails in iterated line graphs

Let G be an undirected connected graph that is not a path. We define h(G) (respectively, s(G)) to be the least integer m such that the iterated line graph L^m(G) has a Hamiltonian cycle (respectively, a spanning closed trail). To obtain upper bounds on h(G) and s(G), we characterize the least integer m such that L^m(G) has a connected subgraph H, in which each edge of H is in a 3-cycle and V(H) contains all vertices of degree not 2 in L^m(G). We characterize the graphs G such that h(G) — 1 (respectively, s(G)) is greater than the radius of G.     

The chromatic index of graphs with a spanning star

Vizing's Theorem states that any graph G has chromatic index either the maximum degree Δ(G) or Δ(G) + 1. If G has 2_s + 1 points and Δ(G) = 2s, a well-known necessary condition for the chromatic index to equal 2_s is that G have at most 2s² lines. Hilton conjectured that this condition is also sufficient. We present a proof of that conjecture and a corollary that helps determine the chromatic index of some graphs with 2s points and maximum degree 2s ? 2.     

Structures and Chromaticity of Extremal 3-Colourable Sparse Graphs

 Assume that G is a 3-colourable connected graph with e(G) = 2v(G) −k, where k≥ 4. It has been shown that s ₃(G) ≥ 2 ^{k −3}, where s _r (G) = P(G,r)/r! for any positive integer r and P(G, λ) is the chromatic polynomial of G. In this paper, we prove that if G is 2-connected and s ₃(G) < 2 ^{k −2}, then G contains at most v(G) −k triangles; and the upper bound is attained only if G is a graph obtained by replacing each edge in the k-cycle C _k by a 2-tree. By using this result, we settle the problem of determining if W(n, s) is χ-unique, where W(n, s) is the graph obtained from the wheel W _n by deleting all but s consecutive spokes. Received: January 29, 1999 Final version received: April 8, 2000     

Sharp bounds for the number of 3‐independent partitions and the chromaticity of bipartite graphs

Given a graph G and an integer k ≥ 1, let α(G, k) denote the number of k‐independent partitions of G. Let ??^?s(p,q) (resp., ??₂^?s(p,q)) denote the family of connected (resp., 2‐connected) graphs which are obtained from the complete bipartite graph K_p,q by deleting a set of s edges, where p ≥ q ≥ 2. This paper first gives a sharp upper bound for α(G,3), where G ∈ ?? ^?s(p,q) and 0 ≤ s ≤ (p ? 1)(q ? 1) (resp., G ∈ ?? ₂^?s(p,q) and 0 ≤ s ≤ p + q ? 4). These bounds are then used to show that if G ∈ ?? ^?s(p,q) (resp., G ∈ ?? ₂^?s (p,q)), then the chromatic equivalence class of G is a subset of the union of the sets ??^?s_i(p+i,q?i) where max and s_i = s ? i(p?q+i) (resp., a subset of ??₂^?s(p,q), where either 0 ≤ s ≤ q ? 1, or s ≤ 2q ? 3 and p ≥ q + 4). By applying these results, we show finally that any 2‐connected graph obtained from K_p,q by deleting a set of edges that forms a matching of size at most q ? 1 or that induces a star is chromatically unique. © 2001 John Wiley & Sons, Inc. J Graph Theory 37: 48–77, 2001     

A simple proof of an inequality connecting the alternating number of independent sets and the decycling number

If s_k denotes the number of independent sets of cardinality k and α(G) is the size of a maximum independent set in graph G, then I(G;x)=s₀+s₁x+?+s_α(G)x^α(G) is the independence polynomial of G (Gutman and Harary, 1983) [8].In this paper we provide an elementary proof of the inequality|I(G;−1)|≤2^φ(G) (Engström, 2009) [7], where φ(G) is the decycling number of G (Beineke and Vandell, 1997) [3], namely, the minimum number of vertices that have to be deleted in order to turn G into a forest.     

On s‐Hamiltonian Line Graphs

For an integer s ≥ 0, a graph G is s‐hamiltonian if for any vertex subset with |S^′| ≤ s, G ‐ S^′ is hamiltonian. It is well known that if a graph G is s‐hamiltonian, then G must be (s+2)‐connected. The converse is not true, as there exist arbitrarily highly connected nonhamiltonian graphs. But for line graphs, we prove that when s ≥ 5, a line graph is s‐hamiltonian if and only if it is (s+2)‐connected.     

Some reproducing identities for families of mean values

Gini, Lehmer, Beckenbach, and others studied the meanG _s (a, b) = (a ^s +b ^s )/(a ^{s 1} +b ^s-1 ) We proveTheorem 1 The identity (ina, b)G _s (G _t ,G _u ) =G _v holds if and only if (s, t, u, v) is (s, t, t, t) (the trivial solution) or one of (1, 1 –k, 1 +k, 1), (1/2, 1 –k, k, 1/2), or (0,–k, k, 0) (the exotic solutions,k is any real number)Theorem 2 IfP _s (a, b) is the power mean [(a ^s +b ^s )/2]^1/s , thenP _s (P _t ,P _u ) =P _v has only the trivial solution (s, t, u, v) = (s, t, t, t) and the exotic solution (0,t, –t, 0) The family of meansG _s (respP _s ) includes the classical arithmetic, geometric, and harmonic means     

Weakly s-semipermutable subgroups of finite groups

In this paper, we introduce the concept of weakly s-semipermutable subgroups. Let G be a finite group. Using the condition that the minimal subgroups or subgroups of order p ² of a given Sylow p-subgroup of G are weakly s-semipermutable in G, we give a criterion for p-nilpotency of G and get some results about formation.     

On some medial semigroups with an associate subgroup

Let S be a semigroup and s,t∈S. We say that t is an associate of s if s=sts. If S has a maximal subgroup G such that every element s of S has a unique associate in G, say s ^∗, we say that G is an associate subgroup of S and consider the mapping s→s ^∗ as a unary operation on S. In this way, semigroups with an associate subgroup may be identified with unary semigroups satisfying three simple axioms. Among them, only those satisfying the identity (st)^∗=t ^∗ s ^∗, called medial, have a structure theorem, due to Blyth and Martins.     

The minimum degree of Ramsey‐minimal graphs

We write H → G if every 2‐coloring of the edges of graph H contains a monochromatic copy of graph G. A graph H is G‐minimal if H → G, but for every proper subgraph H′ of H, H′ ? G. We define s(G) to be the minimum s such that there exists a G‐minimal graph with a vertex of degree s. We prove that s(K_k) = (k ? 1)² and s(K_a,b) = 2 min(a,b) ? 1. We also pose several related open problems. © 2006 Wiley Periodicals, Inc. J Graph Theory 54: 167–177, 2007     

The upper traceable number of a graph

For a nontrivial connected graph G of order n and a linear ordering s: v ₁, v ₂, …, v _n of vertices of G, define . The traceable number t(G) of a graph G is t(G) = min{d(s)} and the upper traceable number t ⁺(G) of G is t ⁺(G) = max{d(s)}, where the minimum and maximum are taken over all linear orderings s of vertices of G. We study upper traceable numbers of several classes of graphs and the relationship between the traceable number and upper traceable number of a graph. All connected graphs G for which t ⁺(G) − t(G) = 1 are characterized and a formula for the upper traceable number of a tree is established. Research supported by Srinakharinwirot University, the Thailand Research Fund and the Commission on Higher Education, Thailand under the grant number MRG 5080075.     

On s-Permutable Subgroups and p-Nilpotency of Finite Groups

A subgroup H of a finite group G is said to be s-permutable in G if H permutes with every Sylow subgroup of G. In this article, some sufficient conditions for a finite group G to be p-nilpotent are given whenever all subgroups with order p ^m of a Sylow p-subgroup of G are s-permutable for a given positive integer m.     

Cycles in a random graph near the critical point

Let G(n, M) be a graph chosen at random from the family of all labelled graphs with n vertices and M(n) = 0.5n + s(n) edges, where s³(n)n^?2→∞ but s(n) = o(n). We find the limit distribution of the length of shortest cycle contained in the largest component of G(n, M), as well as of the longest cycle outside it. We also describe the block structure of G(n, M) and derive from this result the limit probability that G(n, M) contains a cycle with a diagonal. Finally, we show that the probability tending to 1 as n-→∞ the length of the longest cycle in G(n, M) is of the order s²(n)/n.     

Spaces of Functions of Fractional Smoothness on an Irregular Domain

In this paper, we study the spaces B _pq ^s (G) and L _pq ^s (G) of functions with positive exponent of smoothness s > 0, defined on a domain . For a domain G with specific geometric properties, we establish the embedding B _pq ^s (G) = L _pq ^s (G) L _q (G), 1 < p < q < , with the relationship between the parameters defined by these geometric properties.     

Signed 2-independence in graphs

A function f : V→{−1,1} defined on the vertices of a graph G=(V,E) is a signed 2-independence function if the sum of its function values over any closed neighbourhood is at most one. That is, for every vV, f(N[v])1, where N[v] consists of v and every vertex adjacent to v. The weight of a signed 2-independence function is f(V)=∑f(v), over all vertices vV. The signed 2-independence number of a graph G, denoted α_s²(G), equals the maximum weight of a signed 2-independence function of G. In this paper, we establish upper bounds for α_s²(G) in terms of the order and size of the graph, and we characterize the graphs attaining these bounds. For a tree T, upper and lower bounds for α_s²(T) are established and the extremal graphs characterized. It is shown that α_s²(G) can be arbitrarily large negative even for a cubic graph G.     

Conjugates of Rational Equivariant Holomorphic Maps of Symmetric Domains

Let t: D ?D￠\tau: {\cal D} \rightarrow{\cal D}^\prime be an equivariant holomorphic map of symmetric domains associated to a homomorphism r: \Bbb G ?\Bbb G￠{\bf\rho}: {\Bbb G} \rightarrow{\Bbb G}^\prime of semisimple algebraic groups defined over \Bbb Q{\Bbb Q} . If G ì \Bbb G (\Bbb Q)\Gamma\subset {\Bbb G} ({\Bbb Q}) and G￠ ì \Bbb G￠(\Bbb Q)\Gamma^\prime \subset {\Bbb G}^\prime ({\Bbb Q}) are torsion-free arithmetic subgroups with r (G) ì G￠{\bf\rho} (\Gamma) \subset \Gamma^\prime , the map G\D ?G￠\D￠\Gamma\backslash {\cal D} \rightarrow\Gamma^\prime \backslash {\cal D}^\prime of arithmetic varieties and the rationality of D{\cal D} and D￠{\cal D}^\prime as well as the commensurability groups of s ? Aut (\Bbb C)\sigma \in {\rm Aut} ({\Bbb C}) determines a conjugate equivariant holomorphic map t^s: D^s ?D^￠s\tau^\sigma: {\cal D}^\sigma \rightarrow{\cal D}^{\prime\sigma} of f^s: (G\D)^s ?(G￠\D￠)^s\phi^\sigma: (\Gamma\backslash {\cal D})^\sigma \rightarrow(\Gamma^\prime \backslash {\cal D}^\prime)^\sigma of . We prove that is rational if is rational.     

Groups with strongly self-centralizing 3-centralizers

LetG be a finite group with a subgroupM which is the centralizer inG of each of its nonidentity elements and let 3 divide the order ofM. Such groups are classified under the assumption that eitherq=[N _G (M):M]=2^s;s≧0 ands ≠ 3 orq<8. This paper was written while the author was visiting the Department of Mathematics, University of Illinois, Urbana, Illinois 61801.     

Some nordhaus-- gaddum-type results

A Nordhaus--Gaddum-type result is a (tgiht) lower or upper bound on the sum or product of a parameter of a graph and its complement. In this paper some variations are considered. First, the sums and products of ψ(G₁) and ψ(G₂) are examined where G₁ ⊕ G₂ = K(s, s), and ψ is the independence, domination, or independent domination number, inter alia. In particular, it is shown that the maximum value of the product of the domination numbers of G₁ and G₂ is [(s/2 + 2)²] for s ≥ 3. Thereafter it is shown that for H₁ ⊕ H₂ ⊕ H₃ = K_p, the maximum product of the domination numbers of H₂, H₂, and H₃ is p³/27 + Θ(p²).     

Covering and packing in \Bbb Zn{\Bbb Z}^n and \Bbb Rn{\Bbb R}^n, (I)

Given a finite subset A{\cal A} of an additive group \Bbb G{\Bbb G} such as \Bbb Zⁿ{\Bbb Z}^n or \Bbb Rⁿ{\Bbb R}^n , we are interested in efficient covering of \Bbb G{\Bbb G} by translates of A{\cal A} , and efficient packing of translates of A{\cal A} in \Bbb G{\Bbb G} . A set S ì \Bbb G{\cal S} \subset {\Bbb G} provides a covering if the translates A + s{\cal A} + s with s ? Ss \in {\cal S} cover \Bbb G{\Bbb G} (i.e., their union is \Bbb G{\Bbb G} ), and the covering will be efficient if S{\cal S} has small density in \Bbb G{\Bbb G} . On the other hand, a set S ì \Bbb G{\cal S} \subset {\Bbb G} will provide a packing if the translated sets A + s{\cal A} + s with s ? Ss \in {\cal S} are mutually disjoint, and the packing is efficient if S{\cal S} has large density. In the present part (I) we will derive some facts on these concepts when \Bbb G = \Bbb Zⁿ{\Bbb G} = {\Bbb Z}^n , and give estimates for the minimal covering densities and maximal packing densities of finite sets A ì \Bbb Zⁿ{\cal A} \subset {\Bbb Z}^n . In part (II) we will again deal with \Bbb G = \Bbb Zⁿ{\Bbb G} = {\Bbb Z}^n , and study the behaviour of such densities under linear transformations. In part (III) we will turn to \Bbb G = \Bbb Rⁿ{\Bbb G} = {\Bbb R}^n .