On edge colorings with at least \(q\) colors in every subset of \(p\) vertices

zbMath0960.05047MaRDI QIDQ1594601

Gábor N. Sárközy, Stanley M. Selkow

Publication date: 8 February 2001

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/Volume_8/Abstracts/v8i1r9.html

zbMATH Keywords

edge coloringmonochromatic matchingprobabilistic upper bound

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items

The Erdős-Gyárfás problem on generalized Ramsey numbers ⋮ Rainbow subgraphs in edge-colored planar and outerplanar graphs ⋮ Lower bounds on the Erdős–Gyárfás problem via color energy graphs ⋮ The Erdős–Gyárfás function with respect to Gallai‐colorings ⋮ Color Isomorphic Even Cycles and a Related Ramsey Problem ⋮ More distinct distances under local conditions ⋮ An application of the regularity lemma in generalized Ramsey theory ⋮ Local Properties via Color Energy Graphs and Forbidden Configurations ⋮ Generalized Ramsey numbers: forbidding paths with few colors