An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
Collection
Keywords
Publisher
Years
• 1
Electronic Resource
Amsterdam : Elsevier
International Journal for Parasitology 24 (1994), S. 153-154
ISSN: 0020-7519
Source: Elsevier Journal Backfiles on ScienceDirect 1907 - 2002
Topics: Biology , Medicine
Type of Medium: Electronic Resource
Signatur Availability
Others were also interested in ...
• 2
Electronic Resource
Springer
Combinatorica 16 (1996), S. 407-412
ISSN: 1439-6912
Keywords: 05 C 38 ; 05 C 70
Source: Springer Online Journal Archives 1860-2000
Topics: Mathematics
Notes: Abstract We show that if $$\sum\limits_{x \in S} {\deg _{G^x } \geqslant \left| G \right|}$$ , for every stable set $$S \subseteq V\left( G \right),\left| S \right| = k$$ , then the vertex set ofG can be covered withk−1 cycles, edges or vertices. This settles a conjecture by Enomoto, Kaneko and Tuza.
Type of Medium: Electronic Resource
Signatur Availability
Others were also interested in ...
• 3
Electronic Resource
Springer
Order 11 (1994), S. 149-158
ISSN: 1572-9273
Keywords: 06A07 ; Ordered set ; antichain ; fibre
Source: Springer Online Journal Archives 1860-2000
Topics: Mathematics
Notes: Abstract We show that in an ordered setP of width 3 there always exists a fibre (i.e., a subset intersecting each maximal nontrivial antichain) of size at most 11/18|P|. This improves previously known results.
Type of Medium: Electronic Resource
Signatur Availability
Others were also interested in ...
• 4
Electronic Resource
Springer
Order 11 (1994), S. 343-351
ISSN: 1572-9273
Keywords: 06A07 ; 68R10 ; Ordered set ; chain partition ; computational complexity
Source: Springer Online Journal Archives 1860-2000
Topics: Mathematics
Notes: Abstract Lete be a fixed family of chains, i.e.e $$\subseteq \{ \underset{\raise0.3em\hbox{\smash{\scriptscriptstyle\thicksim}}}{1} ,\underset{\raise0.3em\hbox{\smash{\scriptscriptstyle\thicksim}}}{2} ,\underset{\raise0.3em\hbox{\smash{\scriptscriptstyle\thicksim}}}{3} ,...\}$$ . Ae-partition of an ordered setP=(X, ⩽) is a partition ofX into subsets inducing chains isomorphic to the members ofe. In this paper we classify according to the computational complexity problems of existence of ae-partition ofP.
Type of Medium: Electronic Resource
Signatur Availability
Others were also interested in ...
• 5
Electronic Resource
Springer
Order 1 (1985), S. 345-350
ISSN: 1572-9273
Keywords: 05C70 ; Uniform hypergraph ; graph ; tournament ; poset ; Ramsey type theorem ; decomposition
Source: Springer Online Journal Archives 1860-2000
Topics: Mathematics
Notes: Abstract We determine a minimum cardinality family ℱ n, k (resp. ℋ n, k ) ofn-uniform,k-edge hypergraphs satisfying the following property: all, except for finitely many,n-uniform hypergraphs satisfying the divisibility condition have an ℱ n, k -decomposition (resp. vertex ℋ n, k -decomposition).
Type of Medium: Electronic Resource
Signatur Availability
Others were also interested in ...
• 6
Electronic Resource
Springer
Order 8 (1991), S. 17-27
ISSN: 1572-9273
Keywords: 06A23 ; Boolean lattice ; partition ; chain
Source: Springer Online Journal Archives 1860-2000
Topics: Mathematics
Notes: Abstract Let n and c be positive integers. We show that if n is sufficiently large given c then the Boolean lattice consisting of all subsets of an n-element set can be partitioned into chains of size c except for at most c — 1 elements which also form a chain. This settles a conjecture of Griggs.
Type of Medium: Electronic Resource
Signatur Availability
Others were also interested in ...
• 7
Electronic Resource
Springer
Graphs and combinatorics 8 (1992), S. 333-341
ISSN: 1435-5914
Source: Springer Online Journal Archives 1860-2000
Topics: Computer Science , Mathematics
Notes: Abstract Anh-uniform hypergraph generated by a set of edges {E 1,...,E c} is said to be a delta-system Δ(p,h,c) if there is ap-element setF such that ∇F|=p andE i⌢E j=F,∀i≠j. The main result of this paper says that givenp, h andc, there isn 0 such that forn≥n 0 the set of edges of a completeh-uniform hypergraphK n h can be partitioned into subsets generating isomorphic delta-systems Δ(p, h, c) if and only if $$\left( {\begin{array}{*{20}c} n \\ h \\ \end{array} } \right) \equiv 0(\bmod c)$$ . This result is derived from a more general theorem in which the maximum number of delta-systems Δ(p, h, c) that can be packed intoK n h and the minimum number of delta-systems Δ(p, h, c) that can cover the edges ofK n h are determined for largen. Moreover, we prove a theorem on partitioning of the edge set ofK n h into subsets generating small but not necessarily isomorphic delta-systems.
Type of Medium: Electronic Resource
Signatur Availability
Others were also interested in ...
Close ⊗