共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
Deborah Chun 《Discrete Mathematics》2009,309(8):2592-2595
Let be a matroid with rank function , and let . The deletion–contraction polymatroid with rank function will be denoted . Notice that is uniquely determined by and . Similarly, a deletion–contraction polymatroid determines , unless 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 -representable deletion–contraction polymatroids is well-quasi-ordered. From this attractive conjecture, both Rota’s Conjecture and the WQO Conjecture for -representable matroids would follow. 相似文献
3.
《Discrete Mathematics》2017,340(12):2889-2899
4.
Let be a simple connected graph and . An edge set is an -restricted edge cut if is disconnected and each component of contains at least vertices. Let be the minimum size of all -restricted edge cuts and , where is the set of edges with exactly one end vertex in and is the subgraph of induced by . A graph is optimal- if . An optimal- graph is called super -restricted edge-connected if every minimum -restricted edge cut is for some vertex set with and 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- vertex transitive graph to be super 3-restricted edge-connected. In particular, a complete characterization for an optimal- minimal Cayley graph to be super 2-restricted edge-connected is obtained. 相似文献
5.
6.
7.
8.
9.
10.
Diogo Diniz Claudemir Fidelis Bezerra Júnior 《Journal of Pure and Applied Algebra》2018,222(6):1388-1404
Let F be an infinite field. The primeness property for central polynomials of 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 and determine, within the elementary gradings with commutative neutral component, the ones that satisfy this property, namely the crossed product gradings. Next we consider , where R admits a regular grading, with a grading such that is a homogeneous subalgebra and provide sufficient conditions – satisfied by with the trivial grading – to prove that has the primeness property if does. We also prove that the algebras 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 is said to have the property if, given any two disjoint matchings and such that the edges within are pair-wise distance at least from each other as are the edges in , there is a perfect matching in such that and . 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.
Hiroaki Taniguchi 《Discrete Mathematics》2012,312(3):498-508
Let . In , there are four known non-isomorphic -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 for some , we construct a -dimensional dual hyperoval in , which is a quotient of the dual hyperoval of [6]. Moreover, for generators , if and are isomorphic, then we show that or on . Hence, we see that there are many non-isomorphic quotients in for the dual hyperoval of [6] if is large. 相似文献
18.
A graph of order is called degree-equipartite if for every -element set , the degree sequences of the induced subgraphs and 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 and be two positive integers such that and . A graph is an -parity factor of a graph if is a spanning subgraph of and for all vertices , and . In this paper we prove that every connected graph with vertices has an -parity factor if is even, , and for any two nonadjacent vertices , . This extends an earlier result of Nishimura (1992) and strengthens a result of Cai and Li (1998). 相似文献
20.