Your email was sent successfully. Check your inbox.

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

Proceed reservation?

  • Ramsey type theorem  (1)
  • 1
    Electronic Resource
    Electronic Resource
    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
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...