Edge-colored complete graphs with precisely colored subgraphs (Q787167): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of bounds for classical Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: More results on Ramsey-Turán type problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Theorems on Classifications of Subsets of a Given Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Ramsey type theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907600 / rank
 
Normal rank

Latest revision as of 11:32, 14 June 2024

scientific article
Language Label Description Also known as
English
Edge-colored complete graphs with precisely colored subgraphs
scientific article

    Statements

    Edge-colored complete graphs with precisely colored subgraphs (English)
    0 references
    0 references
    1983
    0 references
    0 references
    edge-coloring
    0 references
    complete subgraph
    0 references
    canonical partition theorem
    0 references
    0 references
    0 references