Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number (Q2509762): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q105583662, #quickstatements; #temporary_batch_1711055989931
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: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some intersection theorems for ordered sets and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5543308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path Ramsey numbers in multicolorings / 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: On a problem of K. Zarankiewicz / 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: 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: Q4226453 / 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: A Remark on Stirling's Formula / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic solution for a new class of forbidden r-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879181 / rank
 
Normal rank

Latest revision as of 19:14, 8 July 2024

scientific article
Language Label Description Also known as
English
Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
scientific article

    Statements

    Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number (English)
    0 references
    0 references
    0 references
    0 references
    29 July 2014
    0 references
    extremal graphs for some forbidden graphs
    0 references

    Identifiers