首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
Let M be a matroid with rank function r, and let eE(M). The deletion–contraction polymatroid with rank function f=rM?e+rM/e will be denoted Pe(M). Notice that Pe(M) is uniquely determined by M and e. Similarly, a deletion–contraction polymatroid determines M, unless e is a loop or co-loop. This paper will characterize all polymatroids of this deletion–contraction form by giving the set of excluded minors. Vertigan conjectured that the class of GF(q)-representable deletion–contraction polymatroids is well-quasi-ordered. From this attractive conjecture, both Rota’s Conjecture and the WQO Conjecture for GF(q)-representable matroids would follow.  相似文献   

3.
4.
Let G=(V(G),E(G)) be a simple connected graph and F?E(G). An edge set F is an m-restricted edge cut if G?F is disconnected and each component of G?F contains at least m vertices. Let λ(m)(G) be the minimum size of all m-restricted edge cuts and ξm(G)=min{|ω(U)|:|U|=m and G[U] is connected}, where ω(U) is the set of edges with exactly one end vertex in U and G[U] is the subgraph of G induced by U. A graph G is optimal-λ(m) if λ(m)(G)=ξm(G). An optimal-λ(m) graph is called super m-restricted edge-connected if every minimum m-restricted edge cut is ω(U) for some vertex set U with |U|=m and G[U] being connected. In this note, we give a characterization of super 2-restricted edge-connected vertex transitive graphs and obtain a sharp sufficient condition for an optimal-λ(3) vertex transitive graph to be super 3-restricted edge-connected. In particular, a complete characterization for an optimal-λ(2) minimal Cayley graph to be super 2-restricted edge-connected is obtained.  相似文献   

5.
6.
7.
8.
9.
10.
Let F be an infinite field. The primeness property for central polynomials of Mn(F) was established by A. Regev, i.e., if the product of two polynomials in distinct variables is central then each factor is also central. In this paper we consider the analogous property for Mn(F) and determine, within the elementary gradings with commutative neutral component, the ones that satisfy this property, namely the crossed product gradings. Next we consider Mn(R), where R admits a regular grading, with a grading such that Mn(F) is a homogeneous subalgebra and provide sufficient conditions – satisfied by Mn(E) with the trivial grading – to prove that Mn(R) has the primeness property if Mn(F) does. We also prove that the algebras Ma,b(E) satisfy this property for ordinary central polynomials. Hence we conclude that, over a field of characteristic zero, every verbally prime algebra has the primeness property.  相似文献   

11.
A graph G is said to have the property Ed(m,n) if, given any two disjoint matchings M and N such that the edges within M are pair-wise distance at least d from each other as are the edges in N, there is a perfect matching F in G such that M?F and FN=0?. This property has been previously studied for planar triangulations as well as projective planar triangulations. Here this study is extended to triangulations of the torus and Klein bottle.  相似文献   

12.
13.
14.
15.
16.
17.
Let d3. In PG(d(d+3)/2,2), there are four known non-isomorphic d-dimensional dual hyperovals by now. These are Huybrechts’ dual hyperoval by Huybrechts (2002) [4], Buratti-Del Fra’s dual hyperoval by Buratti and Del Fra (2003) [1], Del Fra and Yoshiara (2005) [3], Veronesean dual hyperoval by Thas and van Maldeghem (2004) [9], Yoshiara (2004) [12] and the dual hyperoval, which is a deformation of Veronesean dual hyperoval by Taniguchi (2009) [6].In this paper, using a generator σ of the Galois group Gal(GF(2dm)/GF(2)) for some m3, we construct a d-dimensional dual hyperoval Tσ in PG(3d,2), which is a quotient of the dual hyperoval of [6]. Moreover, for generators σ,τGal(GF(2dm)/GF(2)), if Tσ and Tτ are isomorphic, then we show that σ=τ or σ=τ?1 on GF(2d). Hence, we see that there are many non-isomorphic quotients in PG(3d,2) for the dual hyperoval of [6] if d is large.  相似文献   

18.
A graph G of order 2n is called degree-equipartite if for every n-element set A?V(G), the degree sequences of the induced subgraphs G[A] and G[V(G)?A] are the same. In this paper, we characterize all degree-equipartite graphs. This answers Problem 1 in the paper by Grünbaum et al. [B. Grünbaum, T. Kaiser, D. Král, and M. Rosenfeld, Equipartite graphs, Israel J. Math. 168 (2008) 431–444].  相似文献   

19.
Let a and b be two positive integers such that ab and ab(mod2). A graph F is an (a,b)-parity factor of a graph G if F is a spanning subgraph of G and for all vertices vV(F), dF(v)b(mod2) and adF(v)b. In this paper we prove that every connected graph G with nb(a+b)(a+b+2)(2a) vertices has an (a,b)-parity factor if na is even, δ(G)(b?a)a+a, and for any two nonadjacent vertices u,vV(G), max{dG(u),dG(v)}ana+b. This extends an earlier result of Nishimura (1992) and strengthens a result of Cai and Li (1998).  相似文献   

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

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