Let A be an asymptotic basis of order h in the sense of additive number theory, and let f( n) denote the maximum number of pairwise disjoint representations of n in the form n = a i 1 + a i 2 + … + a i n , where a i j ∈ A and a i 1 ≤ a i 2 ≤ … ≤ a i h . Let t ≥ 2. If f( n) ≥ clog n for c sufficiently large, then A can be written in the form A = A 1 ⌣ … ⌣ A t , where A i ⌢ A j ≠ ⊘ for 1 ≤ i < j ≤ t and A j is an asumptotic basis of order h for j = 1, …, t. If lim n → ∞ f(n) log n = ∞ , then A = ∪ j = 1 ∞ A j , where A i ⌢ A j = ⊘ for i ≠ j and each A j is an asymptotic basis of order h. These results are obtained by means of some purely combinatorial theorems. Related open problems are also discussed.