On the Ramsey number of trees versus graphs with large clique number

Chvátal established that r(T_m, K_n) = (m – 1)(n – 1) + 1, where T_m is an arbitrary tree of order m and K_n is the complete graph of order n. This result was extended by Chartrand, Gould, and Polimeni who showed K_n could be replaced by a graph with clique number n and order n + 1 provided n ≧ 3 and m ≧ 3. We further extend these results to show that K_n can be replaced by any graph on n + 2 vertices with clique number n, provided n ≧ 5 and m ≧ 4. We then show that further extensions, in particular to graphs on n + 3 vertices with clique number n are impossible. We also investigate the Ramsey number of trees versus complete graphs minus sets of independent edges. We show that r(T_m, K_n –tK₂) = (m – 1)(n – t – 1) + 1 for m ≧ 3, n ≧ 6, where T_m is any tree of order m except the star, and for each t, O ≦ t ≦ [(n – 2)/2].     

Monomial congruences

Letn ₁,n ₂,...,n _t integers. It is proved that the monomial congruence is solvable for allm2 and (a, m)=1 if and only if (n ₁ ,n ₂ ..., n _t )=1.     

Partitioning complete multipartite graphs by monochromatic trees

The tree partition number of an r‐edge‐colored graph G, denoted by t_r(G), is the minimum number k such that whenever the edges of G are colored with r colors, the vertices of G can be covered by at most k vertex‐disjoint monochromatic trees. We determine t₂(K(n₁, n₂,…, n_k)) of the complete k‐partite graph K(n₁, n₂,…, n_k). In particular, we prove that t₂(K(n, m)) = ? (m‐2)/2ⁿ? + 2, where 1 ≤ n ≤ m. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 133–141, 2005     

Total domination in graphs with minimum degree three

A set S of vertices of a graph G is a total dominating set, if every vertex of V(G) is adjacent to some vertex in S. The total domination number of G, denoted by γ_t(G), is the minimum cardinality of a total dominating set of G. We prove that, if G is a graph of order n with minimum degree at least 3, then γ_t(G) ≤ 7n/13. © 2000 John Wiley & Sons, Inc. J Graph Theory 34:9–19, 2000     

Transfer theorems and asymptotic distributional results for m‐ary search trees

We derive asymptotics of moments and identify limiting distributions, under the random permutation model on m‐ary search trees, for functionals that satisfy recurrence relations of a simple additive form. Many important functionals including the space requirement, internal path length, and the so‐called shape functional fall under this framework. The approach is based on establishing transfer theorems that link the order of growth of the input into a particular (deterministic) recurrence to the order of growth of the output. The transfer theorems are used in conjunction with the method of moments to establish limit laws. It is shown that: (i) for small toll sequences (t_n) [roughly, t_n = O(n^1/2)] we have asymptotic normality if m ≤ 26 and typically periodic behavior if m ≥ 27; (ii) for moderate toll sequences [roughly, t_n = ω(n^1/2) but t_n = o(n)] we have convergence to nonnormal distributions if m ≤ m₀ (where m₀ ≥ 26) and typically periodic behavior if m ≥ m₀ + 1; and (iii) for large toll sequences [roughly, t_n = ω(n)] we have convergence to nonnormal distributions for all values of m. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2005     

Translation representations for automorphic solutions of the wave equation in non-euclidean spaces. I

This paper deals with the spectral theory of the Laplace-Beltrami operator Δ acting on automorphic functions in n-dimensional hyperbolic space Hⁿ. We study discrete subgroups Γ which have a fundamental polyhedron F with a finite number of sides and infinite volume. Concerning these we have shown previously that the spectrum of Δ contains at most a finite number of point eigenvalues in [-(1/2(n - 1))², 0], and none less than (1/2(n -1))². Here we prove that the spectrum of Δ is absolutely continuous and of infinite multiplicity in (-∞, -(1/2(n - 1))²). Our approach uses the non-Euclidean wave equation introduced by Faddeev and Pavlov, Energy E_F is defined as (u_t, u_t)-(u, Lu), where the bracket is the L₂ scalar product over a fundamental polyhedron with respect to the invariant volume of the hyperbolic metric. Energy is conserved under the group of operator U(t) relating initial data to data at time t. We construct two isometric representations of the space of automorphic data by L₂(R, N) which transmute the action of U(t) into translation. These representations are given explicitly in terms of integrals of the data over horospheres. In Part II we shall show the completeness of these representations. u_tt-Lu = 0, L = Δ + (1/2(n - 1))².     

On the height of random m-ary search trees

A random m-ary seach tree is constructed from a random permutation of 1,…, n. A law of large numbers is obtained for the height H_n of these trees by applying the theory of branching random walks. in particular, it is shown that H_n/log n→γ in probability as n→∞ where γ = γ(m) is a constant depending upon m only. Interestingly, as m→∞, γ(m) is asymptotic to 1/log m, the coefficient of log n in the asymptotic expression for the height of the complete m-ary search tree. This proves that for large m, random m-ary search trees behave virtually like complete m-ary trees.     

CO‐irredundant Ramsey numbers for graphs

The study of the CO‐irredundant Ramsey numbers t(n₁, ···, n_k) is initiated. It is shown that several values and bounds for these numbers may be obtained from the well‐studied generalized graph Ramsey numbers and the values of t(4, 5), t(4, 6) and t(3, 3, m) are calculated. © 2000 John Wiley & Sons, Inc. J Graph Theory 34: 258–268, 2000     

Irreducible 2‐fold cycle systems

In this paper, it is shown that for any pair of integers (m,n) with 4 ≤ m ≤ n, if there exists an m‐cycle system of order n, then there exists an irreducible 2‐fold m‐cycle system of order n, except when (m,n) = (5,5). A similar result has already been established for the case of 3‐cycles. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 324–332, 2006     

An asymptotic solution to the cycle decomposition problem for complete graphs

Let m₁,m₂,…,mt be a list of integers. It is shown that there exists an integer N such that for all n?N, the complete graph of order n can be decomposed into edge-disjoint cycles of lengths m₁,m₂,…,mt if and only if n is odd, 3?mi?n for i=1,2,…,t, and . In 1981, Alspach conjectured that this result holds for all n, and that a corresponding result also holds for decompositions of complete graphs of even order into cycles and a perfect matching.     

Total domination in 2‐connected graphs and in graphs with no induced 6‐cycles

A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number γ_t(G) of G. It is known [J Graph Theory 35 (2000), 21–45] that if G is a connected graph of order n > 10 with minimum degree at least 2, then γ_t(G) ≤ 4n/7 and the (infinite family of) graphs of large order that achieve equality in this bound are characterized. In this article, we improve this upper bound of 4n/7 for 2‐connected graphs, as well as for connected graphs with no induced 6‐cycle. We prove that if G is a 2‐connected graph of order n > 18, then γ_t(G) ≤ 6n/11. Our proof is an interplay between graph theory and transversals in hypergraphs. We also prove that if G is a connected graph of order n > 18 with minimum degree at least 2 and no induced 6‐cycle, then γ_t(G) ≤ 6n/11. Both bounds are shown to be sharp. © 2008 Wiley Periodicals, Inc. J Graph Theory 60: 55–79, 2009     

Prime T-Ideals in Polynomial and Power Series Rings Over a Pseudo-Valuation Domain

Let R be an m-dimensional pseudo-valuation domain with residue field k, let V be the associated valuation domain with residue field K, and let k ₀ be the maximal separable extension of k in K. We compute the t-dimension of polynomial and power series rings over R. It is easy to see that t-dim R[x ₁,…, x _n ] = 2 if m = 1 and K is transcendental over k, but equals m otherwise, and that t-dim R[[x ₁,…, x _n ]] = ∞ if R is a nonSFT-ring. When R is an SFT-ring, we also show that: (1) t-dim R[[x]] = m; (2) t-dim R[[x ₁,…, x _n ]] = 2m ? 1, if n ≥ 2, K has finite exponent over k ₀, and [k ₀: k] < ∞; (3) t-dim R[[x ₁,…, x _n ]] = 2m, otherwise.     

Wave equations with time-dependent spatial operators of higher order

We study the initial-boundary value problem for ?_t²u(t,x)+A(t)u(t,x)+B(t)?_tu(t,x)=f(t,x) on [0,T]×Ω(Ω??ⁿ) with a homogeneous Dirichlet boundary condition; here A(t) denotes a family of uniformly strongly elliptic operators of order 2m, B(t) denotes a family of spatial differential operators of order less than or equal to m, and u is a scalar function. We prove the existence of a unique strong solution u. Furthermore, an energy estimate for u is given.     

(2, 3, k)-generated groups of large rank

For any fixed k 3 7k \geq 7 there exist integers n_k and a_k such that if the ring R is generated by a set of m elements t₁,...,t_m, where 2t₁-t₁²2t_1-t_1^2 is a unit of finite multiplicative order, and n 3 n_k+ma_kn \geq n_k+ma_k, then the group E_n(R) generated by elementary transvections is an epimorphic image of the triangle group D(2,3,k).\Delta (2,3,k).     

On the existence of one-sided designs

A collection of subsets (called blocks) of a fixed vertex set (possibly with repetition) is called a (t _n , t _n –1, ..., t ₁; a _m , a _m –1, ..., a ₁)-design if it satisfies certain regularity conditions on the number of blocks which contain subsets of the vertex set of certain size, and other regularity conditions on the size of the intersections of certain numbers of the blocks. (For example, a BIBD (or (b, v, r, k, )-configuration) is a (1, 2; 1)-design, and a t-design is a (t, t–1, ..., 1; 1)-design.) A design has design-type (t _n , ..., t ₁; a _m , ..., a ₁) if it satisfies only those conditions. A one-sided design is a design with design-type (t _n , ..., t ₁;) or (;a _m , ..., a ₁). In this paper we show, by construction, that any one-sided design-type is possible.     

On the log-concavity of Hilbert series of Veronese subrings and Ehrhart series

For every positive integer n, consider the linear operator U _n on polynomials of degree at most d with integer coefficients defined as follows: if we write ${\frac{h(t)}{(1 - t)^{d + 1}}=\sum_{m \geq 0} g(m) \, t^{m}}For every positive integer n, consider the linear operator U _n on polynomials of degree at most d with integer coefficients defined as follows: if we write \frach(t)(1 - t)^{d + 1}=?_{m 3 0} g(m)  t^m{\frac{h(t)}{(1 - t)^{d + 1}}=\sum_{m \geq 0} g(m) \, t^{m}} , for some polynomial g(m) with rational coefficients, then \fracU_nh(t)(1- t)^d+1 = ?_{m 3 0}g(nm)  t^m{\frac{{\rm{U}}_{n}h(t)}{(1- t)^{d+1}} = \sum_{m \geq 0}g(nm) \, t^{m}} . We show that there exists a positive integer n _d , depending only on d, such that if h(t) is a polynomial of degree at most d with nonnegative integer coefficients and h(0) = 1, then for n ≥ n _d , U _n h(t) has simple, real, negative roots and positive, strictly log concave and strictly unimodal coefficients. Applications are given to Ehrhart δ-polynomials and unimodular triangulations of dilations of lattice polytopes, as well as Hilbert series of Veronese subrings of Cohen–Macauley graded rings.     

New Results on EX Graphs

By the extremal number ex(n; t) = ex(n; {C ₃, C ₄, . . . , C _t }) we denote the maximum size (that is, number of edges) in a graph of order n > t and girth at least g ≥ t + 1. The set of all the graphs of order n, containing no cycles of length ≥ t, and of size ex(n; t), is denoted by EX(n; t) = EX(n; {C ₃, C ₄, . . . , C _t }), these graphs are called EX graphs. In 1975, Erdős proposed the problem of determining the extremal numbers ex(n; 4) of a graph of order n and girth at least 5. In this paper, we consider a generalized version of this problem, for t ≥ 5. In particular, we prove that ex(29; 6) = 45, also we improve some lower bounds and upper bounds of ex _u (n; t), for some particular values of n and t.     

Minimal graded free resolutions for monomial curves in 𝔸4 defined by almost arithmetic sequences

Let m = (m₀, m₁, m₂, n) be an almost arithmetic sequence, i.e., a sequence of positive integers with gcd(m₀, m₁, m₂, n) = 1, such that m₀ < m₁ < m₂ form an arithmetic progression, n is arbitrary and they minimally generate the numerical semigroup Γ =m₀? +m₁? +m₂? +n?. Let k be a field. The homogeneous coordinate ring k[Γ] of the affine monomial curve parametrically defined by X₀ = t^m₀, X₁ = t^m₁, X₂ = t^m₂, Y = tⁿ is a graded R-module, where R is the polynomial ring k[X₀, X₁, X₂, Y] with the grading degX_i: = m_i, degY: = n. In this paper, we construct a minimal graded free resolution for k[Γ].     

On the Erlang Loss Model with Time Dependent Input

We consider the M(t)/M(t)/m/m queue, where the arrival rate λ(t) and service rate μ(t) are arbitrary (smooth) functions of time. Letting p_n(t) be the probability that n servers are occupied at time t (0≤ n≤ m, t > 0), we study this distribution asymptotically, for m→∞ with a comparably large arrival rate λ(t) = O(m) (with μ(t) = O(1)). We use singular perturbation techniques to solve the forward equation for p_n(t) asymptotically. Particular attention is paid to computing the mean number of occupied servers and the blocking probability p_m(t). The analysis involves several different space-time ranges, as well as different initial conditions (we assume that at t = 0 exactly n₀ servers are occupied, 0≤ n₀≤ m). Numerical studies back up the asymptotic analysis. AMS subject classification: 60K25,34E10 Supported in part by NSF grants DMS-99-71656 and DMS-02-02815     

Almost regular edge colorings and regular decompositions of complete graphs

For k = 1 and k = 2, we prove that the obvious necessary numerical conditions for packing t pairwise edge‐disjoint k‐regular subgraphs of specified orders m₁,m₂,… ,m_t in the complete graph of order n are also sufficient. To do so, we present an edge‐coloring technique which also yields new proofs of various known results on graph factorizations. For example, a new construction for Hamilton cycle decompositions of complete graphs is given. © 2008 Wiley Periodicals, Inc. J Combin Designs 16: 499–506, 2008