Edge-colorings of graphs avoiding complete graphs with a prescribed coloring (Q2359958): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962951681 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1605.08013 / 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: Q5544083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The History of Degenerate (Bipartite) Extremal Graph Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum number of sum-free colorings in finite abelian groups / 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: Hypergraphs with many Kneser colorings / 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 of uniform hypergraphs avoiding monochromatic matchings / 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: Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs / 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 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: Small Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5244856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879181 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:16, 14 July 2024

scientific article
Language Label Description Also known as
English
Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
scientific article

    Statements

    Edge-colorings of graphs avoiding complete graphs with a prescribed coloring (English)
    0 references
    23 June 2017
    0 references
    0 references
    edge coloring
    0 references
    extremal graph
    0 references
    symmetrization
    0 references
    Hölder inequality
    0 references
    regularity
    0 references
    0 references
    0 references