Anti-Ramsey numbers for vertex-disjoint triangles (Q2092342): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete solution for the rainbow numbers of matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal number of independent triangles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rainbow \(k\)-matching in the complete graph with \(r\) colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow generalizations of Ramsey theory: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The anti-Ramsey number of perfect matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colorings with no large polychromatic stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colorings of complete graphs that avoid polychromatic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-Ramsey numbers for graphs with independent cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An anti-Ramsey theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An anti-Ramsey theorem on cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow numbers for matchings and complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On restricted colourings of \(K_ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of independent cycles in a graph / rank
 
Normal rank

Latest revision as of 17:46, 30 July 2024

scientific article
Language Label Description Also known as
English
Anti-Ramsey numbers for vertex-disjoint triangles
scientific article

    Statements

    Anti-Ramsey numbers for vertex-disjoint triangles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 November 2022
    0 references
    anti-Ramsey number
    0 references
    complete graphs
    0 references
    vertex-disjoint triangles
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references