Vertex Partitions of K4,4-Minor Free Graphs

 We prove that a 4-connected K _4,4-minor free graph on n vertices has at most 4n−8 edges and we use this result to show that every K _4,4-minor free graph has vertex-arboricity at most 4. This improves the case (n,m)=(7,3) of the following conjecture of Woodall: the vertex set of a graph without a K _n -minor and without a -minor can be partitioned in n−m+1 subgraphs without a K _m -minor and without a -minor. Received: January 7, 1998 Final version received: May 17, 1999     

Linear series computing the Clifford index of a projective curve

For a (smooth irreducible) curveC of genus g and Clifford indexc>2 with a linear seriesg _d ^r computing c (so ) it is well known thatc + 2 ≤d ≤2 (c + 2), and if then 2c + 1 ≤g ≤ 2c + 4 unlessd = 2c + 4 in which caseg = 2c + 5. Let c ≥ 0 andg be integers. If 2c + 1 ≤g ≤2c + 4 we prove that for any integerd <g such thatd ≡c mod 2 andc + 2 ≤d < 2(c + 2) there exists a curve of genus g and Clifford index c with a g_d ^r computing c. Ford ≥c + 6 (i.e.r ≥ 3) we construct this curve on a surface of degree 2r-2 in ℙ^r, and ford ≥c + 8 (i.e.r ≥ 4) we show that such a curve cannot be found on a surface in ℙ^r of smaller degree. In fact, if g_d ^r computes the Clifford index c of C such thatc + 8 ≤d ≤ 2c + 3 then the birational morphism defined by this series cannot map C onto a (maybe, singular) curve contained in a surface of degree at most 2r-3 in ℙ^r.     

An elementary approach to gap theorems

Using elementary comparison geometry, we prove: Let (M, g) be a simply-connected complete Riemannian manifold of dimension ≥ 3. Suppose that the sectional curvature K satisfies −1 − s(r) ≤ K ≤ −1, where r denotes distance to a fixed point in M. If lim _{r → ∞} e^2r s(r) = 0, then (M, g) has to be isometric to ℍ ⁿ . The same proof also yields that if K satisfies −s(r) ≤ K ≤ 0 where lim _{r → ∞} r ² s(r) = 0, then (M, g) is isometric to ℝ ⁿ , a result due to Greene and Wu. Our second result is a local one: Let (M, g) be any Riemannian manifold. For a ∈ ℝ, if K ≤ a on a geodesic ball B _p (R) in M and K = a on ∂B _p (R), then K = a on B _p (R).     

The Iyengar inequality,revisited

Detailed analysis shows that the famous Iyengar inequality actually says that the Trapezoidal formula is a central algorithm for approximating integrals over an appropriate interval for the class of functions whose derivatives are bounded by a positive number K in L _∞-sense. The inherent nonlinearity from central algorithms reflects the importance of the Iyengar inequality and thus makes familiar linear methods malfunction when one tries to generalize it. It is shown that the generalization depends on a nonlinear system of equations satisfied by a set of free nodes of a perfect spline. Explicit constructions are obtained in the spirit of the Iyengar inequality for the class of functions whose rth (r≤4) derivatives are bounded by a positive number K in L _∞-sense because a closed solution to the nonlinear system is only available for r≤4. Connections with computational mathematics, especially with best interpolation and best quadrature, are discussed. Numerical experiments are also included. AMS subject classification (2000)  65D30, 41A17     

The Smallest Degree Sum That Yields Potentially Kr＋1 - K3-Graphic Sequences

Let a（Kr,＋1 - K3,n） be the smallest even integer such that each n-term graphic sequence п= （d1,d2,…dn） with term sum σ（п） = d1 ＋ d2 ＋…＋ dn 〉 σ（Kr＋1 -K3,n） has a realization containing Kr＋1 - K3 as a subgraph, where Kr＋1 -K3 is a graph obtained from a complete graph Kr＋1 by deleting three edges which form a triangle. In this paper, we determine the value σ（Kr＋1 - K3,n） for r ≥ 3 and n ≥ 3r＋ 5.     

Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture

Chen, Lih, and Wu conjectured that for r ≥ 3, the only connected graphs with maximum degree at most r that are not equitably r-colorable are K _r,r (for odd r) and K _r+1. If true, this would be a strengthening of the Hajnal-Szemerédi Theorem and Brooks’ Theorem. We extend their conjecture to disconnected graphs. For r ≥ 6 the conjecture says the following: If an r-colorable graph G with maximum degree r is not equitably r-colorable then r is odd, G contains K _r,r and V(G) partitions into subsets V ₀, …, V _t such that G[V ₀] = K _r,r and for each 1 ≤ i ≤ t, G[V _i ] = K _r . We characterize graphs satisfying the conclusion of our conjecture for all r and use the characterization to prove that the two conjectures are equivalent. This new conjecture may help to prove the Chen-Lih-Wu Conjecture by induction.     

On the Maximum Number of Cliques in a Graph

A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following graph classes: (1) graphs with n vertices and m edges; (2) graphs with n vertices, m edges, and maximum degree Δ; (3) d-degenerate graphs with n vertices and m edges; (4) planar graphs with n vertices and m edges; and (5) graphs with n vertices and no K₅-minor or no K_3,3-minor. For example, the maximum number of cliques in a planar graph with n vertices is 8(n − 2). Research supported by a Marie Curie Fellowship of the European Community under contract 023865, and by the projects MCYT-FEDER BFM2003-00368 and Gen. Cat 2001SGR00224.     

A Remark on the Rank of Positive Semidefinite Matrices Subject to Affine Constraints

Let K _n be the cone of positive semidefinite n X n matrices and let ? be an affine subspace of the space of symmetric matrices such that the intersection K _n ∩? is nonempty and bounded. Suppose that n ≥ 3 and that \codim ? = r+2 \choose 2 for some 1 ≤ r ≤ n-2 . Then there is a matrix X ∈ K _n ∩? such that rank X ≤ r . We give a short geometric proof of this result, use it to improve a bound on realizability of weighted graphs as graphs of distances between points in Euclidean space, and describe its relation to theorems of Bohnenblust, Friedland and Loewy, and Au-Yeung and Poon. Received July 8, 1999, and in revised form January 20, 2000, and May 9, 2000. Online publication September 22, 2000.     

Maximal regular subsemibands of finite order-preserving transformation semigroups <Emphasis Type="Italic">K</Emphasis>(<Emphasis Type="Italic">n</Emphasis>,<Emphasis Type="Italic">r</Emphasis>)

Let O _n be the order-preserving transformation semigroup on X _n . For an arbitrary integer r such that 1≤r≤n−2, we completely describe the maximal regular subsemibands of the semigroup K(n,r)={α∈O _n :|im(α)|≤r}. We also formulate the cardinal number of such subsemigroups.     

On Some Three-Color Ramsey Numbers

 In this paper we study three-color Ramsey numbers. Let K _i,j denote a complete i by j bipartite graph. We shall show that (i) for any connected graphs G ₁, G ₂ and G ₃, if r(G ₁, G ₂)≥s(G ₃), then r(G ₁, G ₂, G ₃)≥(r(G ₁, G ₂)−1)(χ(G ₃)−1)+s(G ₃), where s(G ₃) is the chromatic surplus of G ₃; (ii) (k+m−2)(n−1)+1≤r(K _1,k , K _1,m , K _n )≤ (k+m−1)(n−1)+1, and if k or m is odd, the second inequality becomes an equality; (iii) for any fixed m≥k≥2, there is a constant c such that r(K _k,m , K _k,m , K _n )≤c(n/logn), and r(C _2m , C _2m , K _n )≤c(n/logn) ^m/(m−1) for sufficiently large n. Received: July 25, 2000 Final version received: July 30, 2002 RID="*" ID="*" Partially supported by RGC, Hong Kong; FRG, Hong Kong Baptist University; and by NSFC, the scientific foundations of education ministry of China, and the foundations of Jiangsu Province Acknowledgments. The authors are grateful to the referee for his valuable comments. AMS 2000 MSC: 05C55     

On 2-Connected Spanning Subgraphs with Bounded Degree in K 1,r -Free Graphs

For any integer r > 1, an r-trestle of a graph G is a 2-connected spanning subgraph F with maximum degree Δ(F) ≤ r. A graph G is called K _1,r -free if G has no K _1,r as an induced subgraph. Inspired by the work of Ryjáček and Tkáč, we show that every 2-connected K _1,r -free graph has an r-trestle. The paper concludes with a corollary of this result for the existence of k-walks.     

L p approximation by Bernstein-Kantorovich quasi-interpolants

Bernstein-Kantorovich quasi-interpolants K^（2r-1）n（f, x） are considered and direct, inverse and equivalence theorems with Ditzian-Totik modulus of smoothness ω^2rφ（f, t）p （1 ≤ p ≤＋∞） are obtained.     

Maximal Subsemigroups of Finite Transformation Semigroups K（n, r）

Let Tn be the full transformation semigroup on the n-element set Xn. For an arbitrary integer r such that 2 ≤ r ≤ n-1, we completely describe the maximal subsemigroups of the semigroup K(n, r) = {α∈Tn : |im α| ≤ r}. We also formulate the cardinal number of such subsemigroups which is an answer to Problem 46 of Tetrad in 1969, concerning the number of subsemigroups of Tn.     

Rank properties of certain semigroups

In this paper we consider certain ranks of some semigroups. These ranks are r ₁(S),r ₂(S),r ₃(S),r ₄(S) and r ₅(S) as defined below. We have r ₁≤r ₂≤r ₃≤r ₄≤r ₅. The semigroups are CL _n ,CL _m ×CL _n ,Z _n and SL _n . Here CL _n is a chain with n elements, Z _n is the zero semigroup on n elements and SL _n is the free semilattice generated by n elements and having 2 ⁿ −1 elements. We find many of the ranks for these classes of semigroups.     

A New Lower Bound For A Ramsey-Type Problem

Let 3 ≤ r < s be fixed integers and let G be a graph on n vertices not containing a complete graph on s vertices. The main aim of this paper is to provide a new lower bound on the size of the maximum subset of G without a copy of complete graph K_r. Our results substantially improve previous bounds of Krivelevich and Bollobás and Hind. * Research supported in part by NSF grants DMS-0106589, CCR-9987845 and by the State of New Jersey. Part of this research was done while visiting Microsoft Research.     

On a graph property generalizing planarity and flatness

We introduce a topological graph parameter σ(G), defined for any graph G. This parameter characterizes subgraphs of paths, outerplanar graphs, planar graphs, and graphs that have a flat embedding as those graphs G with σ(G)≤1,2,3, and 4, respectively. Among several other theorems, we show that if H is a minor of G, then σ(H)≤σ(G), that σ(K _n )=n−1, and that if H is the suspension of G, then σ(H)=σ(G)+1. Furthermore, we show that μ(G)≤σ(G) + 2 for each graph G. Here μ(G) is the graph parameter introduced by Colin de Verdière in [2].     

The smallest degree sum that yields potentially Kr,r-graphic sequences

We consider a variation of a classical Turán-type extremal problem as follows: Determine the smallest even integer σ(K_r,r,n) such that every n-term graphic sequence π = (d₁,d₂,...,d_n) with term sum σ(π) = d₁ + d₂ + ... + d_n ≥ σ(K_r,r,n) is potentially K_r,r-graphic, where K_r,r is an r × r complete bipartite graph, i.e. π has a realization G containing K_r,r as its subgraph. In this paper, the values σ(K_r,r,n) for even r and n ≥ 4r² - r - 6 and for odd r and n ≥ 4r² + 3r - 8 are determined.     

Quasiminimizers in one dimension: integrability of the derivative,inverse function and obstacle problems

It is shown that a K-quasiminimizer u for the one-dimensional p-Dirichlet integral is a K′-quasiminimizer for the q-Dirichlet integral, 1  ≤  q  <  p ₁(p, K), where p ₁(p, K) > p; the exact value for p ₁(p, K) is obtained. The inverse function of a non-constant u is also K′′-quasiminimizer for the s-Dirichlet integral and the range of the exponent s is specified. Connections between quasiminimizers, superminimizers and solutions to obstacle problems are studied.     

On hamiltonicity of <Emphasis Type="Italic">P</Emphasis><Subscript>3</Subscript>-dominated graphs

We introduce a new class of graphs which we call P ₃-dominated graphs. This class properly contains all quasi-claw-free graphs, and hence all claw-free graphs. Let G be a 2-connected P ₃-dominated graph. We prove that G is hamiltonian if α(G ²) ≤ κ(G), with two exceptions: K _2,3 and K _1,1,3. We also prove that G is hamiltonian, if G is 3-connected and |V(G)| ≤ 5δ(G) − 5. These results extend known results on (quasi-)claw-free graphs. This paper was completed when both authors visited the Center for Combinatorics, Nankai University, Tianjin. They gratefully acknowledge the hospitality and support of the Center for Combinatorics and Nankai University. The work of E.Vumar is sponsored by SRF for ROCS, REM.     

Wavelet expansions of fractal measures

Let μ be a measure on ℝⁿ that satisfies the estimate μ(B _r(x))≤cr ^α for allx ∈ ℝⁿ and allr ≤ 1 (B _r(x) denotes the ball of radius r centered atx. Let ϕ _j,k ^(ɛ) (x)=2 ^nj2ϕ^(ɛ)(2 ^j x-k) be a wavelet basis forj ∈ ℤ, κ ∈ ℤⁿ, and ∈ ∈E, a finite set, and letP _j (T)=Σ_ɛ,k <T,ϕ _j,k ^(ɛ) >ϕ _j,k ^(ɛ) denote the associated projection operators at levelj (T is a suitable measure or distribution). Iff ∈Ls ^p(dμ) for 1 ≤p ≤ ∞, we show thatP _j(f dμ) ∈ L^p(dx) and ||P _j (fdμ)||L _p(dx)≤c2 ^{j((n-α)/p′))}||f||L _p(dμ) for allj ≥ 0. We also obtain estimates for the limsup and liminf of ||P _j (fdμ)||L _p(dx) under more restrictive hypotheses. Communicated by Guido Weiss