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

zbMATH Open0960.05047MaRDI QIDQ1594601FDOQ1594601

Authors: Gábor N. Sárközy, Stanley 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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• The Erdős-Gyárfás problem on generalized Ramsey numbers
• An explicit edge-coloring of \(K_n\) with six colors on every \(K_5\)
• Edge-coloring cliques with three colors on all 4-cliques
• scientific article; zbMATH DE number 2197930
• A variant of the classical Ramsey problem

zbMATH Keywords

edge coloringmonochromatic matchingprobabilistic upper bound

Mathematics Subject Classification ID

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

Cited In (18)

• The Erdős–Gyárfás function with respect to Gallai‐colorings
• Title not available (Why is that?)
• Generalized Ramsey numbers: forbidding paths with few colors
• More distinct distances under local conditions
• Essentially Infinite Colourings of Graphs
• Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable
• Lower bounds on the Erdős–Gyárfás problem via color energy graphs
• The Erdős-Gyárfás function \(f(n, 4, 5) = \frac{5}{6} n + o(n)\) -- so Gyárfás was right
• An application of the regularity lemma in generalized Ramsey theory
• Title not available (Why is that?)
• Growth rates of the bipartite Erdős-Gyárfás function
• Local Properties via Color Energy Graphs and Forbidden Configurations
• Color Isomorphic Even Cycles and a Related Ramsey Problem
• The Erdős-Gyárfás problem on generalized Ramsey numbers
• Edge-coloring cliques with many colors on subcliques
• Rainbow subgraphs in edge-colored planar and outerplanar graphs
• New bounds on the generalized Ramsey number \(f(n, 5, 8)\)
• Title not available (Why is that?)

This page was built for publication: On edge colorings with at least \(q\) colors in every subset of \(p\) vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1594601)