scientific article; zbMATH DE number 881297
From MaRDI portal
Publication:4879181
DOI10.1002/(SICI)1097-0118(199604)21:4%3C441::AID-JGT10%3E3.0.CO;2-IzbMATH Open0846.05026MaRDI QIDQ4879181FDOQ4879181
Authors: Raphael Yuster 
Publication date: 22 May 1996
Title of this publication is not available (Why is that?)
Recommendations
Cited In (39)
- Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
- On 3-colorings of \(E(K_ n)\)
- The maximum number of \(K_{3}\)-free and \(K_{4}\)-free edge 4-colorings
- Counting H-free orientations of graphs
- Remarks on an edge-coloring problem
- Hypergraphs with many Kneser colorings
- Improved bound on the maximum number of clique-free colorings with two and three colors
- Title not available (Why is that?)
- Colourings without monochromatic disjoint pairs
- Monochromatic subgraphs in graphs
- An extension of the rainbow Erdős-Rothschild problem
- On two problems in Ramsey-Turán theory
- Colouring set families without monochromatic \(k\)-chains
- Integer colorings with forbidden rainbow sums
- THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
- Title not available (Why is that?)
- Exact results on the number of restricted edge colorings for some families of linear hypergraphs
- Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number
- Rainbow Erdös-Rothschild problem for the Fano plane
- Edge-colorings avoiding fixed rainbow stars
- Maximum number of triangle-free edge colourings with five and six colours
- Maximum number of sum-free colorings in finite abelian groups
- Edge-colorings of uniform hypergraphs avoiding monochromatic matchings
- Edge-colorings avoiding patterns in a triangle
- A note on graph colouring
- The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
- The number of colorings of planar graphs with no separating triangles
- Edge colourings of graphs avoiding monochromatic matchings of a given size
- Graphs with many edge-colorings such that complete graphs are rainbow
- Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
- A rainbow Erdős-Rothschild problem
- On the maximum number of integer colourings with forbidden monochromatic sums
- Edge-colorings avoiding a fixed matching with a prescribed color pattern
- Stability for the Erdős-Rothschild problem
- Edge colorings of graphs without monochromatic stars
- A rainbow Erdös-Rothschild problem
- Edge disjoint monochromatic triangles in 2-colored graphs
- On graphs with a large number of edge-colorings avoiding a rainbow triangle
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4879181)
