Metric packing for K 3+K 3

In this paper, we consider the metric packing problem for the commodity graph of disjoint two triangles K ₃+K ₃, which is dual to the multiflow feasibility problem for the commodity graph K ₃+K ₃. We prove a strengthening of Karzanov’s conjecture concerning quarterintegral packings by certain bipartite metrics.     

Vertex-disjoint K_1+(K_1 ∪ K_2) in K_(1,4)-free Graphs with Minimum Degree at Least Four

A graph is said to be K1,4-free if it does not contain an induced subgraph isomorphic to K1,4.Let k be an integer with k≥2.We prove that ifG is a K1,4-free graph of order at least 11k-10 with minimum degree at least four,then G contains k vertex-disjoint copies of K1+(K1∪K2).     

K-非常凸空间

本文引入了一种新的K凸空间K-非常凸空间,及其对偶空间K-非常光滑空间,它们分别是非常凸空间和非常光滑空间的推广但又严格弱于非常凸空间和非常光滑空间,因此它们又有许多独特的性质.本文讨论了它们的一些特性及与其它K凸性和K光滑性的关系,推广了[3]、[6]、[7]、[8]中的一些结果.     

Directed PBDs with Block Sizes from K Where K

The research on directed PBDs is motivated by the construction of t‐deletion/insertion‐correcting codes. Fuji‐Hara, Miao, Wang, and Yin have determined the existence of directed PBDs with block sizes from the set and the set completely. In this paper, we consider the cases of . We settle almost completely for these cases, leaving finite values undetermined.     

Graph partition into K 3s and K 4s

Let s and k be two integers with 0≤s≤k and let G be a simple graph of order n≥3s+4(k?s)+3. In this paper we prove that if σ ₂(G)≥3(n?s)/2+k?2, then G ? sK ₃+(k?s)K ₄. We also show that the degree condition is sharp in some sense.     

The K -discretization and K -incident graphs for discretizable Distance Geometry

The Distance Geometry Problem (DGP) is the problem of determining whether a realization for a simple weighted undirected graph $$G=(V,E,d)$$ in a given Euclidean space exists so that the distances between pairs of realized vertices u, $$v \in V$$ correspond to the weights $$d_{uv}$$, for each $$\{u,v\} \in E$$. We focus on a special class of DGP instances, referred to as the Discretizable DGP (DDGP), and we introduce the K-discretization and the K-incident graphs for the DDGP class. The K-discretization graph is independent on the vertex order that can be assigned to V, and can be useful for discovering whether one of such orders actually exists so that the DDGP assumptions are satisfied. The use of a given vertex order allows the definition of another important graph, the K-incident graph, which is potentially useful for performing pre-processing analysis on the solution set of DDGP instances.     

Achromatic Number of K 5 × K n for Small n

The achromatic number of a graph G is the maximum number of colours in a proper vertex colouring of G such that for any two distinct colours there is an edge of G incident with vertices of those two colours. We determine the achromatic number of the Cartesian product of K ₅ and K _n for all n ≤ 24.     

局部和中点局部K一致光滑空间

本文引进（弱）中点局部K一致光滑空间的概念,并讨论了局部K一致光滑空间和中点局部K一致光滑空间的性质以及它们和一些已知K-光滑空间之间的关系.     

The decomposition of Kv into K2×K5''s

The decomposition of the complete graph Kv into Kr×Kc's, the products of Kr and Kc,is originated from the use of DNA library screening. In this paper, we consider the case where r=2 and c = 5, and show that such a decomposition exists if and only if v ≡ 1 (mod 25).     

The Versatility of MMAP[K] and the MMAP[K]/G[K]/1 Queue

This paper studies a single server queueing system with multiple types of customers. The first part of the paper discusses some modeling issues associated with the Markov arrival processes with marked arrivals (MMAP[K], where K is an integer representing the number of types of customers). The usefulness of MMAP[K] in modeling point processes is shown by a number of interesting examples. The second part of the paper studies a single server queueing system with an MMAP[K] as its input process. The busy period, virtual waiting time, and actual waiting times are studied. The focus is on the actual waiting times of individual types of customers. Explicit formulas are obtained for the Laplace–Stieltjes transforms of these actual waiting times.     

Regularity for weakly (K1, K2)-quasiregular mappings

In this paper, we first give the definition of weakly (K1, K2)-quasiregular mappings, and then by using the Hodge decomposition and the weakly reverse Holder inequality, we obtain their regularity property: For any ql that satisfies 0 < K1n(n+4)/22n+1 × 100n2[23n/2(25n + 1)](n - q1) < 1, there exists p1 = p1(n, q1, K1, K2) > n, such that any (K1, K2)-quasiregular mapping f ∈W(loc)(1,q1)(Ω,Rn) is in fact in W(loc)(1,p1)(Ω,Rn). That is, f is (K1, K2)-quasiregular in the usual sense.     

λKv的最大K2,3填充设计和最小K2,3覆盖设计

对于一个有限简单图G,λK_v的G-设计(G-填充,G-覆盖),记为(v,G,λ)-GD((v,G,λ)-PD,(v,G,λ)-CD),是一个(X,B),其中X是K_v的顶点集,B是K_v的子图族,每个子图(称为区组)均同构于G,且K_v中任一边都恰好(最多,至少)出现在B的λ个区组中.一个填充(覆盖)设计称为是最大(最小)的,如果没有其它的这种填充(覆盖)设计具有更多(更少)的区组.本文对于λ>1确定了(v,K_2,3,λ)-GD的存在谱,并对任意λ构造了λK_v的最大K_2,3-填充设计和最小K_2,3-覆盖设计.     

Inseparable Körpererweiterungen

Ohne Zusammenfassung