首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
In this paper, we give sufficient conditions for a graph to have degree bounded trees. Let G be a connected graph and AV(G). We denote by σk(A) the minimum value of the degree sum in G of any k pairwise nonadjacent vertices of A, and by w(GA) the number of components of the subgraph GA of G induced by V(G)A. Our main results are the following: (i) If σk(A)|G|1, then G contains a tree T with maximum degree ⩽k and AV(T). (ii) If σkw(GA)(A)|A|1, then G contains a spanning tree T with dT(x)k for any xA. These are generalizations of the result by S. Win [S. Win, Existenz von Gerüsten mit Vorgeschriebenem Maximalgrad in Graphen, Abh. Math. Seminar Univ. Humburg 43 (1975) 263–267] and degree conditions are sharp.  相似文献   

2.
3.
4.
Given a simple graph H, a self-orthogonal decomposition (SOD) of H is a collection of subgraphs of H, all isomorphic to some graph G, such that every edge of H occurs in exactly two of the subgraphs and any two of the subgraphs share exactly one edge. Our concept of SOD is a natural generalization of the well-studied orthogonal double covers (ODC) of complete graphs. If for some given G there is an appropriate H, then our goal is to find one with as few vertices as possible. Special attention is paid to the case when G a matching with n1 edges. We conjecture that v(H)=2n2 is best possible if n4 is even and v(H)=2n if n is odd. We present a construction which proves this conjecture for all but 4 of the possible residue classes of n modulo 18.  相似文献   

5.
6.
7.
Let R, S and T be finite sets with |R|=r, |S|=s and |T|=t. A code CR×S×T with covering radius 1 and minimum distance 2 is closely connected to a certain generalized partial Latin rectangle. We present various constructions of such codes and some lower bounds on their minimal cardinality K(r,s,t;2). These bounds turn out to be best possible in many instances. Focussing on the special case t=s we determine K(r,s,s;2) when r divides s, when r=s1, when s is large, relative to r, when r is large, relative to s, as well as K(3r,2r,2r;2). Finally, a table with bounds on K(r,s,s;2) is given.  相似文献   

8.
We consider a tournament T=(V,A). For X?V, the subtournament of T induced by X is T[X]=(X,A(X×X)). An interval of T is a subset X of V such that, for a,bX and xV?X, (a,x)A if and only if (b,x)A. The trivial intervals of T are ?, {x}(xV) and V. A tournament is indecomposable if all its intervals are trivial. For n?2, W2n+1 denotes the unique indecomposable tournament defined on {0,,2n} such that W2n+1[{0,,2n?1}] is the usual total order. Given an indecomposable tournament T, W5(T) denotes the set of vV such that there is W?V satisfying vW and T[W] is isomorphic to W5. Latka [6] characterized the indecomposable tournaments T such that W5(T)=?. The authors [1] proved that if W5(T)?, then |W5(T)|?|V|?2. In this note, we characterize the indecomposable tournaments T such that |W5(T)|=|V|?2.  相似文献   

9.
In the context of local Tb theorems with Lp testing conditions we prove an enhanced Cotlar's inequality. This is related to the problem of removing the so called buffer assumption of Hytönen–Nazarov, which is the final barrier for the full solution of S. Hofmann's problem. We also investigate the problem of extending the Hytönen–Nazarov result to non-homogeneous measures. We work not just with the Lebesgue measure but with measures μ in Rd satisfying μ(B(x,r))Crn, n(0,d]. The range of exponents in the Cotlar type inequality depend on n. Without assuming buffer we get the full range of exponents p,q(1,2] for measures with n1, and in general we get p,q[2??(n),2], ?(n)>0. Consequences for (non-homogeneous) local Tb theorems are discussed.  相似文献   

10.
We study vertex partitions of graphs according to their Colin de Verdiere parameter μ. By a result of Ding et al. [DOSOO] we know that any graph G with μ(G)2 admits a vertex partition into two graphs with μ at most μ(G)1. Here we prove that any graph G with μ(G)3 admits a vertex partition into three graphs with μ at most μ(G)2. This study is extended to other minor-monotone graph parameters like the Hadwiger number.  相似文献   

11.
12.
13.
Recently, Tenner [B.E. Tenner, Reduced decompositions and permutation patterns, J. Algebraic. Combin., in press, preprint arXiv: math.CO/0506242] studied the set of posets of a permutation of length n with unique maximal element, which arise naturally when studying the set of zonotopal tilings of Elnitsky's polygon. In this paper, we prove that the number of such posets is given byP5n4P5(n1)+2P5(n2)j=0n2CjP5(n2j), where Pn is the nth Padovan number and Cn is the nth Catalan number.  相似文献   

14.
15.
16.
Let G be a non-Abelian, connected, nilpotent Lie group. Then there exist 0αCc(G) and 0ξL2(G) such that α1ξ=0, contrary to what happens for the group Rn. Moreover, the set of zero divisors is a total subset of L2(G). This result is first proven for the Heisenberg group Hn where it is based on the existence of non-trivial Schwartz functions f satisfying f1(Xk+iYk)=0 for 1?k?n. To cite this article: J. Ludwig et al., C. R. Acad. Sci. Paris, Ser. I 342 (2006).  相似文献   

17.
A subgroup H of a group G is said to permute with the subgroup K of G if HK=KH. Subgroups H and K are mutually permutable (totally permutable) in G if every subgroup of H permutes with K and every subgroup of K permutes with H (if every subgroup of H permutes with every subgroup of K). If H and K are mutually permutable and HK=1, then H and K are totally permutable. A subgroup H of G is S-permutable in G if H permutes with every Sylow subgroup of G. A group G is called a PST-group if S-permutability is a transitive relation in G. Let {p1,,pn,pn+1,,pk} be the set of prime divisors of the order of a finite group G with {p1,,pn} the set of prime divisors of the order of the normal subgroup N of G. A set of Sylow subgroups {P1,,Pn,Pn+1,,Pk}, PiSylpi(G), form a strong Sylow system with respect to N if PiPj is a mutually permutable product for all i{1,2,,n} and j{1,2,,k}. We show that a finite group G is a solvable PST-group if and only if it has a normal subgroup N such that G/N is nilpotent and G has a strong Sylow system with respect to N. It is also shown that G is a solvable PST-group if and only if G has a normal solvable PST-subgroup N and G/N is a solvable PST-group.  相似文献   

18.
19.
20.
We consider the indefinite Sturm–Liouville problem ?f=λrf, f(?1)=f(1)=0 where rL1[?1,1] satisfies xr(x)>0. Conditions are presented such that the (normed) eigenfunctions fn form a Riesz basis of the Hilbert space L|r|2[?1,1] (using known results for a modified problem). The main focus is on the non-Riesz basis case: We construct a function fL|r|2[?1,1] having no eigenfunction expansion f=βnfn. Furthermore, a sequence (αn)l2 is constructed such that the “Fourier series” αnfn does not converge in L|r|2[?1,1]. These problems are closely related to the regularity property of the closed non-semibounded symmetric sesquilinear form t[u,v]=uv¯pdx with Dirichlet boundary conditions in L2[?1,1] where p=1/r. For the associated operator Tt we construct elements in the difference between domt and the domain of the associated regular closed form, i.e. dom|Tt|1/2.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号