The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques (Q5360466): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of oriantations having no fixed tournament / 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: Q4288119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser Colorings of Uniform Hypergraphs / 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 coloring problem for intersecting vector spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colorings avoiding fixed rainbow stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Colourings of Hypergraphs Without Monochromatic Fano Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structural result for hypergraphs with many restricted edge colorings / 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: Q5781249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set-coloring of edges and multigraph Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879181 / rank
 
Normal rank

Latest revision as of 10:52, 14 July 2024

scientific article; zbMATH DE number 6782258
Language Label Description Also known as
English
The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
scientific article; zbMATH DE number 6782258

    Statements

    The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques (English)
    0 references
    0 references
    0 references
    0 references
    28 September 2017
    0 references
    stability theorem for complete multipartite graphs
    0 references

    Identifiers