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

DOI10.1017/S0963548322000293MaRDI QIDQ5885201FDOQ5885201

Emily Heath, Alex Cameron

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

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\)

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)

Cites Work

• The Erdős-Gyárfás problem on generalized Ramsey numbers
• Title not available (Why is that?)
• A (5,5)-Colouring of K_n with Few Colours
• A variant of the classical Ramsey problem
• Edge-coloring cliques with three colors on all 4-cliques
• An explicit construction for a Ramsey problem
• Edge-coloring cliques with many colors on subcliques

Cited In (3)

• Title not available (Why is that?)
• On the generalized Erdös-Szekeres conjecture -- a new upper bound
• New bounds on the generalized Ramsey number \(f(n, 5, 8)\)

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)