共查询到10条相似文献,搜索用时 109 毫秒
1.
Alexander Rosa 《Journal of Combinatorial Theory, Series A》1975,18(3):305-312
We prove that D(2v + 1) ? v + 1 + D(v) for v > 3 where D(v) denotes the maximum number of pairwise disjoint Steiner triple systems of order v. Since D(v) ? v ? 2 it follows that for v > 3, D(2v + 1) = 2v ?1 whenever D(v) = v ? 2. 相似文献
2.
Dhruba R. Adhikari 《Nonlinear Analysis: Theory, Methods & Applications》2011,74(14):4622-4641
Let X be an infinite dimensional real reflexive Banach space with dual space X∗ and G⊂X, open and bounded. Assume that X and X∗ are locally uniformly convex. Let T:X⊃D(T)→2X∗ be maximal monotone and strongly quasibounded, S:X⊃D(S)→X∗ maximal monotone, and C:X⊃D(C)→X∗ strongly quasibounded w.r.t. S and such that it satisfies a generalized (S+)-condition w.r.t. S. Assume that D(S)=L⊂D(T)∩D(C), where L is a dense subspace of X, and 0∈T(0),S(0)=0. A new topological degree theory is introduced for the sum T+S+C, with degree mapping d(T+S+C,G,0). The reason for this development is the creation of a useful tool for the study of a class of time-dependent problems involving three operators. This degree theory is based on a degree theory that was recently developed by Kartsatos and Skrypnik just for the single-valued sum S+C, as above. 相似文献
3.
Lu Jia-Xi 《Journal of Combinatorial Theory, Series A》1984,37(2):189-192
Let D(v) denote the maximum number of pairwise disjoint Steiner triple systems of order v. In this paper, we prove that D(v) = v ? 2 holds for all v ≡ 1, 3 (mod 6) (v>7), except possibly v = 141, 283, 501, 789, 1501, 2365. 相似文献
4.
In this paper, we investigate the relation between the lower topology respectively the Lawson topology on a product of posets and their corresponding topological product. We show that (1) if S and T are nonsingleton posets, then Ω(S×T)=Ω(S)×Ω(T) iff both S and T are finitely generated upper sets; (2) if S and T are nontrivial posets with σ(S) or σ(T) being continuous, then Λ(S×T)=Λ(S)×Λ(T) iff S and T satisfy property K, where for a poset L, Ω(L) means the lower topological space, Λ(L) means the Lawson topological space, and L is said to satisfy property K if for any x∈L, there exist a Scott open U and a finite F⊆L with x∈U⊆↑F. 相似文献
5.
For a digraph D, let L(D) and S(D) denote its line digraph and subdivision digraph, respectively. The motivation of this paper is to solve the digraph equation L(S(D))=S(L(D)). We show that L(S(D)) and S(L(D)) are cospectral if and only if D and L(D) have the same number of arcs. Further, we characterize the situation that L(S(D)) and S(L(D)) are isomorphic. Our approach introduces the new notion, the proper image D* of a digraph D, and a new type of connectedness for digraphs. The concept D* plays an important role in the main result of this paper. It is also useful in other aspects of the study of line digraphs. For example, L(D) is connected if and only if D* is connected; L(D) is functional (contrafunctional) if and only if D* is functional (contrafunctional). Some related results are also presented. 相似文献
6.
In this paper, we consider the network improvement problem for multicut by upgrading nodes in a directed tree T = (V, E) with multiple sources and multiple terminals. In a node based upgrading model, a node v can be upgraded at the expense of c(v) and such an upgrade reduces weights on all edges incident to v. The objective is to upgrade a minimum cost subset S ⊆ V of nodes such that the resulting network has a multicut in which no edge has weight larger than a given value D. We first obtain a minimum cardinality node multicut Vc for tree T, then find the minimum cost upgrading set based on the upgrading sets for the subtrees rooted at the nodes in Vc. We show that our algorithm is polynomial when the number of source–terminal pairs is upper bounded by a given value. 相似文献
7.
Kenjiro Ogawa 《Discrete Mathematics》2010,310(22):3276-3277
For a poset P=(X,≤), the upper bound graph (UB-graph) of P is the graph U=(X,EU), where uv∈EU if and only if u≠v and there exists m∈X such that u,v≤m. For a graph G, the distance two graph DS2(G) is the graph with vertex set V(DS2(G))=V(G) and u,v∈V(DS2(G)) are adjacent if and only if dG(u,v)=2. In this paper, we deal with distance two graphs of upper bound graphs. We obtain a characterization of distance two graphs of split upper bound graphs. 相似文献
8.
Alice Hubenko 《Discrete Mathematics》2008,308(7):1018-1024
Let us call a digraph D cycle-connected if for every pair of vertices u,v∈V(D) there exists a cycle containing both u and v. In this paper we study the following open problem introduced by Ádám. Let D be a cycle-connected digraph. Does there exist a universal edge in D, i.e., an edge e∈E(D) such that for every w∈V(D) there exists a cycle C such that w∈V(C) and e∈E(C)?In his 2001 paper Hetyei conjectured that cycle-connectivity always implies the existence of a universal edge. In the present paper we prove the conjecture of Hetyei for bitournaments. 相似文献
9.
Dhruba R. Adhikari 《Journal of Mathematical Analysis and Applications》2008,348(1):122-136
Let X be a real reflexive Banach space with dual X∗. Let L:X⊃D(L)→X∗ be densely defined, linear and maximal monotone. Let T:X⊃D(T)→X∗2, with 0∈D(T) and 0∈T(0), be strongly quasibounded and maximal monotone, and C:X⊃D(C)→X∗ bounded, demicontinuous and of type (S+) w.r.t. D(L). A new topological degree theory has been developed for the sum L+T+C. This degree theory is an extension of the Berkovits-Mustonen theory (for T=0) and an improvement of the work of Addou and Mermri (for T:X→X∗2 bounded). Unbounded maximal monotone operators with are strongly quasibounded and may be used with the new degree theory. 相似文献
10.
Lijun Ji 《Designs, Codes and Cryptography》2007,43(2-3):115-122
A Steiner system S(t, k, v) is called i-resolvable, 0 < i < t, if its block set can be partitioned into S(i, k, v). In this paper, a 2-resolvable S(3, 4, v) is used to construct a large set of disjoint Kirkman triple systems of order 3v − 3 (briefly LKTS) and some new orders for LKTS are then obtained.
Research supported by Tianyuan Mathematics Foundation of NSFC Grant 10526032 and Natural Science Foundation of Universities
of Jiangsu Province Grant 05KJB110111. 相似文献