Two proofs of the Ramsey property of the class of finite hypergraphs (Q1835932): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Models Without Indiscernibles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4056030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3903002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity and Positional Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of finite relational and set systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3872505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3869384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple proof of the existence of restricted Ramsey graphs by means of a partite construction / rank
 
Normal rank

Latest revision as of 18:00, 13 June 2024

scientific article
Language Label Description Also known as
English
Two proofs of the Ramsey property of the class of finite hypergraphs
scientific article

    Statements

    Two proofs of the Ramsey property of the class of finite hypergraphs (English)
    0 references
    0 references
    0 references
    1982
    0 references
    0 references
    monochromatic subhypergraph
    0 references
    coloring hyperedges
    0 references
    uniform hypergraph
    0 references