New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers

DOI10.1017/S0963548322000293MaRDI QIDQ5885201FDOQ5885201

Authors Alex Cameron, Emily Heath

Publication date 3 April 2023

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2006.09577

zbMATH Keywords

Ramsey theorygraph colouringgeneralized Ramsey number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Recommendations

• The Erdős-Gyárfás problem on generalized Ramsey numbers
• A (5,5)-Colouring of K_n with Few Colours
• On a generalized anti-Ramsey problem
• Lower bounds on the Erdős–Gyárfás problem via color energy graphs
• An explicit edge-coloring of \(K_n\) with six colors on every \(K_5\)

Cites work

• scientific article; zbMATH DE number 3540832 (Why is no real title available?)
• A (5,5)-Colouring of K_n with Few Colours
• A variant of the classical Ramsey problem
• An explicit construction for a Ramsey problem
• Edge-coloring cliques with many colors on subcliques
• Edge-coloring cliques with three colors on all 4-cliques
• The Erdős-Gyárfás problem on generalized Ramsey numbers

Cited in

(6)

• The Erdős-Gyárfás problem on generalized Ramsey numbers
• New Upper Bounds for the Erd\H{o}s-Gy\'arf\'as Problem on Generalized Ramsey Numbers
• An explicit edge-coloring of \(K_n\) with six colors on every \(K_5\)
• New bounds on the generalized Ramsey number \(f(n, 5, 8)\)
• On the generalized Erdös-Szekeres conjecture -- a new upper bound
• scientific article; zbMATH DE number 2218940 (Why is no real title available?)

This page was built for publication: New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers

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