Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs (Q3869384): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
(One intermediate revision by one other user not shown)
label / enlabel / en
 
Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs
Property / cites work
 
Property / cites work: Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4088855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey property for graphs with forbidden complete subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of finite relational and set systems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.21136/cmj.1979.101598 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2604212301 / rank
 
Normal rank
Property / title
 
Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs (English)
Property / title: Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs (English) / rank
 
Normal rank

Revision as of 10:14, 30 July 2024

scientific article
Language Label Description Also known as
English
Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs
scientific article

    Statements

    0 references
    0 references
    1979
    0 references
    Ramsey type theorem for hypergraphs
    0 references
    Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs (English)
    0 references

    Identifiers