On graphs with a large number of edge-colorings avoiding a rainbow triangle (Q2403696): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2017.06.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2738179066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on the number of edge colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colorings of graphs avoiding complete graphs with a prescribed coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colorings avoiding a fixed matching with a prescribed color pattern / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rainbow Erdős-Rothschild problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of <i>K</i> <sub>3</sub> -free and <i>K</i> <sub>4</sub> -free edge 4-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879181 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:55, 14 July 2024

scientific article
Language Label Description Also known as
English
On graphs with a large number of edge-colorings avoiding a rainbow triangle
scientific article

    Statements

    On graphs with a large number of edge-colorings avoiding a rainbow triangle (English)
    0 references
    0 references
    0 references
    0 references
    11 September 2017
    0 references
    \(r\)-edge-colorings
    0 references
    regularity lemma
    0 references

    Identifiers