scientific article; zbMATH DE number 881297
From MaRDI portal
Publication:4879181
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199604)21:4<441::AID-JGT10>3.0.CO;2-I" /><441::AID-JGT10>3.0.CO;2-I 10.1002/(SICI)1097-0118(199604)21:4<441::AID-JGT10>3.0.CO;2-IzbMath0846.05026MaRDI QIDQ4879181
Publication date: 22 May 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (29)
Edge-colorings of graphs avoiding complete graphs with a prescribed coloring ⋮ Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size ⋮ Stability for the Erdős-Rothschild problem ⋮ Remarks on an edge-coloring problem ⋮ Edge-colorings avoiding a fixed matching with a prescribed color pattern ⋮ Counting H-free orientations of graphs ⋮ A rainbow Erdős-Rothschild problem ⋮ Edge-colorings avoiding fixed rainbow stars ⋮ Maximum number of sum-free colorings in finite abelian groups ⋮ Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors ⋮ On graphs with a large number of edge-colorings avoiding a rainbow triangle ⋮ On the maximum number of integer colourings with forbidden monochromatic sums ⋮ Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph ⋮ On Two Problems in Ramsey--Turán Theory ⋮ Integer colorings with forbidden rainbow sums ⋮ Hypergraphs with many Kneser colorings ⋮ A Rainbow Erdös--Rothschild Problem ⋮ The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques ⋮ Edge-colorings avoiding patterns in a triangle ⋮ Graphs with many edge-colorings such that complete graphs are rainbow ⋮ Edge-colorings of uniform hypergraphs avoiding monochromatic matchings ⋮ Colourings without monochromatic disjoint pairs ⋮ Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs ⋮ Edge colorings of graphs without monochromatic stars ⋮ Unnamed Item ⋮ An extension of the rainbow Erdős-Rothschild problem ⋮ Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number ⋮ Rainbow Erdös--Rothschild Problem for the Fano Plane ⋮ Colouring set families without monochromatic \(k\)-chains
This page was built for publication:
