## Abstract It is shown that, for all sufficiently large __k__, the complete graph __K~n~__ can be decomposed into __k__ factors of diameter 2 if and only if __n__ ≥ 6__k__.
On a Conjecture of Kátai for Additive Functions
✍ Scribed by Eduard Wirsing; Tang Yuan-sheng; Shao Pin-tsung
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 181 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
✦ Synopsis
Ka tai himself gave partial solutions. In he proved that &2f (n)&=0(n &1 )
( 3 )
article no. 0027
📜 SIMILAR VOLUMES
The aim of this paper is to show that for any n ¥ N, n > 3, there exist a, b ¥ N\* such that n=a+b, the ''lengths'' of a and b having the same parity (see the text for the definition of the ''length'' of a natural number). Also we will show that for any n ¥ N, n > 2, n ] 5, 10, there exist a, b ¥ N\
In this paper we prove some properties of p -additive functions as well as p -additive set -valued functions. We start with some definitions. Definition 2.1. A set C ⊆ X (where X is a vector space) is said to be a convex cone if and only if C + C ⊆ C and t C ⊆ C for all t ∈ (0, ∞). Definition 2.2.
Let f # Z[x] with degree k and let p be a prime. By a complete trigonometric sum we mean a sum of the form S(q, f )= q x=1 e q ( f (x)), where q is a positive integer and e q (:)=exp(2?if (x)Âq). Professor Chalk made a conjecture on the upper bound of S(q, f ) when q is a prime power. We prove Chalk