The proof of Ushio’s conjecture concerning path factorization of complete bipartite graphs

Let K _m,n be a complete bipartite graph with two partite sets having m and n vertices, respectively. A P _v -factorization of K _m,n is a set of edge-disjoint P _v -factors of K _m,n which partition the set of edges of K _m,n . When v is an even number, Wang and Ushio gave a necessary and sufficient condition for existence of P _v -factorization of K _m,n . When k is an odd number, Ushio in 1993 proposed a conjecture. Very recently, we have proved that Ushio’s conjecture is true when v = 4k − 1. In this paper we shall show that Ushio Conjecture is true when v = 4k − 1, and then Ushio’s conjecture is true. That is, we will prove that a necessary and sufficient condition for the existence of a P _4k+1-factorization of K _m,n is (i) 2km≤(2k+1)n, (ii) 2kn≤(2k+1)m, (iii) m+n≡0 (mod 4k+1), (iv) (4k+1)mn/[4k(m+n)] is an integer.     

P4k?1-factorization of bipartite multigraphs

Let λK _m,n be a bipartite multigraph with two partite sets having m and n vertices, respectively. A P _v-factorization of λK _m,n is a set of edge-disjoint P _v -factors of λK _m,n which partition the set of edges of λK _m,n. When v is an even number, Ushio, Wang and the second author of the paper gave a necessary and sufficient condition for the existence of a P _v -factorization of λK _m,n. When v is an odd number, we proposed a conjecture. However, up to now we only know that the conjecture is true for v = 3. In this paper we will show that the conjecture is true when v = 4k − 1. That is, we shall prove that a necessary and sufficient condition for the existence of a P _4k−1-factorization of λK _m,n is (1) (2k − 1)m ⩽ 2kn, (2) (2k − 1)n ⩽ 2km, (3) m + n ≡ 0 (mod 4k − 1), (4) λ(4k − 1)mn/[2(2k − 1)(m + n)] is an integer.     

The spectrum of path factorization of bipartite multigraphs

LetλK_(m,n)be a bipartite multigraph with two partite sets having m and n vertices, respectively.A P_v-factorization ofλK_(m,n)is a set of edge-disjoint P_v-factors ofλK_(m,n)which partition the set of edges ofλK_(m,n).When v is an even number,Ushio,Wang and the second author of the paper gave a necessary and sufficient condition for the existence of a P_v-factorization ofλK_(m,n).When v is an odd number,we have proposed a conjecture.Very recently,we have proved that the conjecture is true when v=4k-1.In this paper we shall show that the conjecture is true when v = 4k 1,and then the conjecture is true.That is,we will prove that the necessary and sufficient conditions for the existence of a P_(4k 1)-factorization ofλK_(m,n)are(1)2km≤(2k 1)n,(2)2kn≤(2k 1)m,(3)m n≡0(mod 4k 1),(4)λ(4k 1)mn/[4k(m n)]is an integer.     

P_(4k-1)-factorization of complete bipartite graphs

Let Km,n be a complete bipartite graph with two partite sets having m and n vertices, respectively. A Pv-factorization of Km,n is a set of edge-disjoint pv-factors of Km,n which partition the set of edges of Km,n. When v is an even number, Wang and Ushio gave a necessary and sufficient condition for the existence of Pv-factorization of Km,n.When v is an odd number, Ushio in 1993 proposed a conjecture. However, up to now we only know that Ushio Conjecture is true for v = 3. In this paper we will show that Ushio Conjecture is true when v = 4k - 1. That is, we shall prove that a necessary and sufficient condition for the existence of a P4k-1-factorization of Km,n is (1) (2k - 1)m ≤ 2kn, (2) (2k -1)n≤2km, (3) m n ≡ 0 (mod 4k - 1), (4) (4k -1)mn/[2(2k -1)(m n)] is an integer.     

P 4k−1-factorization of bipartite multigraphs

Let λK _m,n be a bipartite multigraph with two partite sets having m and n vertices, respectively. A P _v-factorization of λK _m,n is a set of edge-disjoint P _v -factors of λK _m,n which partition the set of edges of λK _m,n. When v is an even number, Ushio, Wang and the second author of the paper gave a necessary and sufficient condition for the existence of a P _v -factorization of λK _m,n. When v is an odd number, we proposed a conjecture. However, up to now we only know that the conjecture is true for v = 3. In this paper we will show that the conjecture is true when v = 4k ? 1. That is, we shall prove that a necessary and sufficient condition for the existence of a P _4k?1-factorization of λK _m,n is (1) (2k ? 1)m ? 2kn, (2) (2k ? 1)n ? 2km, (3) m + n ≡ 0 (mod 4k ? 1), (4) λ(4k ? 1)mn/[2(2k ? 1)(m + n)] is an integer.     

P4κ-1-factorization of bipartite multigraphs

LetλKm,n be a bipartite multigraph with two partite sets having m and n vertices, respectively. A Pv-factorization of λKm,n is a set of edge-disjoint Pv-factors of λKm,n which partition the set of edges of λKm,n. When v is an even number, Ushio, Wang and the second author of the paper gave a necessary and sufficient condition for the existence of a Pv-factorization of λKm,n. When v is an odd number, we proposed a conjecture. However, up to now we only know that the conjecture is true for v= 3. In this paper we will show that the conjecture is true when v= 4k- 1. That is, we shall prove that a necessary and sufficient condition for the existence of a P4k-1-factorization of λKm,n is (1) (2κ - 1)m ≤ 2kn, (2) (2k - 1)n ≤ 2km, (3) m + n ≡0 (mod 4κ - 1), (4) λ(4κ - 1)mn/[2(2κ - 1)(m + n)] is an integer.     

On <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis>,<Emphasis Type="Italic">q</Emphasis></Subscript>-factorization of complete bipartite multigraphs

Let λK _m,n be a complete bipartite multigraph with two partite sets having m and n vertices, respectively. A K _p,q -factorization of λK _m,n is a set of edge-disjoint K _p,q -factors of λK _m,n which partition the set of edges of λK _m,n . When p = 1 and q is a prime number, Wang, in his paper [On K _1,q -factorization of complete bipartite graph, Discrete Math., 126: (1994), 359-364], investigated the K _1,q -factorization of K _m,n and gave a sufficient condition for such a factorization to exist. In papers [K _1,k -factorization of complete bipartite graphs, Discrete Math., 259: 301-306 (2002),; K _p,q -factorization of complete bipartite graphs, Sci. China Ser. A-Math., 47: (2004), 473-479], Du and Wang extended Wang’s result to the case that p and q are any positive integers. In this paper, we give a sufficient condition for λK _m,n to have a K _p,q -factorization. As a special case, it is shown that the necessary condition for the K _p,q -factorization of λK _m,n is always sufficient when p : q = k : (k + 1) for any positive integer k.     

On 4-semiregular 1-factorizations of complete graphs and complete bipartite graphs

A 4-semiregular 1-factorization is a 1-factorization in which every pair of distinct 1-factors forms a union of 4-cycles. LetK be the complete graphK _2nor the complete bipartite graphK _{n, n} .We prove that there is a 4-semiregular 1-factorization ofK if and only ifn is a power of 2 andn2, and 4-semiregular 1-factorizations ofK are isomorphic, and then we determine the symmetry groups. They are known for the case of the complete graphK _2n ,however, we prove them in a different method.     

Upper bound theorems for homology manifolds

In this paper we prove the Upper Bound Conjecture (UBC) for some classes of (simplicial) homology manifolds: we show that the UBC holds for all odd-dimensional homology manifolds and for all 2k-dimensional homology manifolds Δ such that β _k (Δ)⩽Σ{β _i (Δ):i ≠k-2,k,k+2 and 1 ⩽i⩽2k-1}, where β _i (Δ) are reduced Betti numbers of Δ. (This condition is satisfied by 2k-dimensional homology manifolds with Euler characteristic χ≤2 whenk is even or χ≥2 whenk is odd, and for those having vanishing middle homology.) We prove an analog of the UBC for all other even-dimensional homology manifolds. Kuhnel conjectured that for every 2k-dimensional combinatorial manifold withn vertices, . We prove this conjecture for all 2k-dimensional homology manifolds withn vertices, wheren≥4k+3 orn≤3k+3. We also obtain upper bounds on the (weighted) sum of the Betti numbers of odd-dimensional homology manifolds.     

On the volume of equichordal sets

IfK is an equichordal set of chord length 1, i.e. ann-dimensional convex body with a pointp K such that every chord throughp has length 1, it can be shown that _n /2 ⁿ v(K) < _n /2, wherev(K) denotes the volume ofK and _n the volume of ann-dimensional unit ball. Explicit estimates are established for the deviation ofK from a ball of radius 1/2 ifv(K)– _n /2 ⁿ is small, and from a semiball of radius 1 if 1/2 _n –v(K) is small.Supported by National Science Foundation Research Grant DMS 8701893.     

On K 1,k -factorization of bipartite multigraphs

A K1,k-factorization of λKm,n is a set of edge-disjoint K1,k-factors of λKm,n, which partition the set of edges of λKm,n. In this paper, it is proved that a sufficient condition for the existence of K1,k-factorization of λKm,n, whenever k is any positive integer, is that （1） m ≤ kn, （2） n ≤ km, （3） km-n = kn-m ≡ 0 （mod （k^2- 1）） and （4） λ（km-n）（kn-m） ≡ 0 （mod k（k- 1）（k^2 - 1）（m ＋ n））.     

P 3-factorization of complete multipartite graphs

In this note it is shown that a necessary and sufficient condition for the existence of a P3-factorizatlon of complete multipartite graph λK, is (1) m≥3, (2) mn≡0(mod 3) and (3)λ(m-1)n≡0(mod 4).     

Enumeration of rectangular arrays by length and coincidences

Summary Explicit formulas are obtained for the number of p-line arrays of integers (a_ij) (i=1, 2, ..., p; j=1, 2, ..., n) satisfying 1=a_p1=...=a₁₁⩽a_p2⩽...a₁₂⩽...⩽a_pn⩽...⩽a_1n and a_1j⩽j (j=1, 2, ..., n) and having k coincidences. (A coincidence is a column in which a_1j=...=a_pj.) Entrata in Redazione il 20 giugno 1972. Supported in part by NSF grant GP-17031.     

Kp,q-factorization of complete bipartite graphs

Let K _m,nbe a complete bipartite graph with two partite sets having m and n vertices, respectively. A K _p,q-factorization of K _m,n is a set of edge-disjoint K _p,q-factors of K _m,n which partition the set of edges of K _m,n. When p = 1 and q is a prime number, Wang, in his paper “On K _1,k -factorizations of a complete bipartite graph” (Discrete Math, 1994, 126: 359—364), investigated the K _1,q -factorization of K _m,nand gave a sufficient condition for such a factorization to exist. In the paper “K _1,k -factorizations of complete bipartite graphs” (Discrete Math, 2002, 259: 301—306), Du and Wang extended Wang’s result to the case that q is any positive integer. In this paper, we give a sufficient condition for K _m,n to have a K _p,q-factorization. As a special case, it is shown that the Martin’s BAC conjecture is true when p : q = k : (k+ 1) for any positive integer k.     

A bound for Wilson''''s general theorem

Given any set K of positive integers and positive integer λ, let c(K,λ) denote the smallest integer such that v∈B(K,λ) for every integer v≥c(K,λ) that satisfies the congruences λv(v-1)≡0 (mod β(K) and λ(v-1)≡0 (mod α(K)). Let K0 be an equivalent set of K, k and k* be the smallest and the largest integers in K0. We prove that c(K,λ)≤exp exp{Q0}Qo=max{2(2p(ko)2-k2kk)p(ko)4,(Kk242y-k-2)(y2)}, whereand y=k*+k(k-1)+1.     

Selection of the number of regression variables; A minimax choice of generalized FPE

Summary A generalized Final Prediction Error (FPE_α)_ criterion is considered. Based onn observations, the numberk of regression variables is selected from a given range 0≦k≦K, so as to minimize . It is shown that if α tends to infinity withn, the selection is consistent but the maximum of the mean squared error of estimates of parameters diverges to infinity with the same order of divergence as that of α. A meaningful minimax choice of α exists for a regret type mean squared error, while for simple mean squared error it is trivially 0. The minimax regret choice of α converges to a constant, approximately 3.5 forK≧8 ifn−K increases simultaneously withn, otherwise it diverges to infinity withn.     

A splitting theorem for connected moravaK-theories

LetX be a connected, locally finite spectrum and letk(n) (n>-1) denote the (−1)-connected cover of then-th MoravaK-Theory associated to the primep.k(n) is aBP-module spectrum with π_*(k(n)) ≅ ℤ _p [υ _n ] where |v _n | = 2(p ⁿ -1). We prove the following splitting theorem: Thek(n) ^*-torsion ofk(n) ^* (X) is already annihilated byv _n ^e (e≥1) if and only ifk(n)ΛX is homotopy equivalent to a wedge of spectrak(n) and ^r k(n) (0≤r≤e-1) where ^r k(n) denotes ther-th Postnikov factor ofk(n). Moreover we investigate splitting conditions for ^r k(n)ΛX.     

Minimum Resolvable Coverings of K v with Copies of K 4 ? e

Suppose K _v is the complete undirected graph with v vertices and K ₄ − e is the graph obtained from a complete graph K ₄ by removing one edge. Let (K ₄ − e)-MRC(v) denote a resolvable covering of K _v with copies of K ₄ − e with the minimum possible number n(v, K ₄ − e) of parallel classes. It is readily verified that n(v, K₄-e) 3 é2(v-1)/5 ù{n(v, K_4-e) \geq \lceil 2(v-1)/5 \rceil} . In this article, it is proved that there exists a (K ₄ − e)-MRC(v) with é2(v-1)/5 ù{\lceil 2(v-1)/5 \rceil} parallel classes if and only if v ≡ 0 (mod 4) with the possible exceptions of v = 108, 172, 228, 292, 296, 308, 412. In addition, the known results on the existence of maximum resolvable (K ₄ − e)-packings are also improved.     

Regularity for weakly (K<Subscript>1</Subscript>, K<Subscript>2</Subscript>)-quasiregular mappings

In this paper, we first give the definition of weakly (K₁,K₂-quasiregular mappings, and then by using the Hodge decomposition and the weakly reverse Hölder inequality, we obtain their regularity property: For anyq ₁ that satisfies\(0< K_1 n^{(n + 4)/2} 2^{n + 1} \times 100^{n^2 } [2^{3n/2} (2^{5n} + 1)](n - q_1 )< 1\), there existsp ₁=p ₁(n,q ₁,K ₁,K ₂)>n, such that any (K₁, K₂)-quasiregular mapping\(f \in W_{loc}^{1,q_1 } (\Omega ,R^n )\) is in fact in\(W_{loc}^{1,p_1 } (\Omega , R^n )\). That is, f is (K₁,K₂)-quasiregular in the usual sense.     

On simultaneous approximation to a differentiable function and its derivative by inverse Pal-Type interpolation polynomials

Let ξ_{n −1} < ξ_{n −2} < ξ_{n − 2} < ... < ξ₁ be the zeros of the the (n−1)-th Legendre polynomial P_n−1(x) and −1=x_n<x_n−1<...<x₁=1, the zeros of the polynomial . By the theory of the inverse Pal-Type interpolation, for a function f(x)∈C _[−1,1] ¹ , there exists a unique polynomial R_n(x) of degree 2n−2 (if n is even) satisfying conditions R_n(f, ξ_k) = f (ε_k) (1 ⩽ k ⩽ n −1); R¹ _n(f,x_k)=f¹(x_k)(1≤k≤n). This paper discusses the simultaneous approximation to a differentiable function f by inverse Pal-Type interpolation polynomial {R_n(f, x)} (n is even) and the main result of this paper is that if f∈C _[1,1] ^r , r≥2, n≥r+2, and n is even then |R¹ _n(f,x)−f¹(x)|=0(1)|W_n(x)|h(x)·n^3−r·E_2n−r−3(f^(r)) holds uniformly for all x∈[−1,1], where .