New bounds on the generalized Ramsey number \(f(n, 5, 8)\)

DOI10.1016/j.disc.2024.114012zbMATH Open1539.05093MaRDI QIDQ6542039

Shira Zerbib, [[Person:6109794|Author name not available (Why is that?)]], Alex Parker, Emily Heath, Enrique Gomez-Leos

Publication date: 21 May 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

generalized Ramsey theoryhypergraph matchings

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• An explicit construction for a Ramsey problem
• A variant of the classical Ramsey problem
• Edge-coloring cliques with three colors on all 4-cliques
• A generalized Ramsey problem
• On edge colorings with at least \(q\) colors in every subset of \(p\) vertices
• On generalized Ramsey theory: The bipartite case
• Local properties in colored graphs, distinct distances, and difference sets
• The probabilistic method
• The Erdős-Gyárfás problem on generalized Ramsey numbers
• An application of the regularity lemma in generalized Ramsey theory
• A (5,5)-Colouring of K_n with Few Colours
• Local Properties via Color Energy Graphs and Forbidden Configurations
• New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers
• Lower bounds on the Erdős–Gyárfás problem via color energy graphs
• Conflict-free hypergraph matchings

This page was built for publication: New bounds on the generalized Ramsey number \(f(n, 5, 8)\)

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