Ramsey theory constructions from hypergraph matchings

DOI10.1090/PROC/16413MaRDI QIDQ6621271

Dhruv Mubayi, Felix Joos

Publication date: 18 October 2024

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

edge-coloringgeneralized Ramsey theoryhypergraph matchings

Mathematics Subject Classification ID

Hypergraphs (05C65) Ramsey theory (05D10)

Cites Work

• Title not available (Why is that?)
• 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 generalized Ramsey theory: The bipartite case
• The probabilistic method
• The Erdős-Gyárfás problem on generalized Ramsey numbers
• Conflict-free hypergraph matchings
• The Erdős-Gyárfás function \(f(n, 4, 5) = \frac{5}{6} n + o(n)\) -- so Gyárfás was right

This page was built for publication: Ramsey theory constructions from hypergraph matchings

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