Ramsey numbers of hypergraphs with a given size

DOI10.1017/S0305004124000409MaRDI QIDQ7013876zbMATH OpenFDO

Authors Domagoj Bradač, Jacob Fox, Benny Sudakov

Publication date 12 March 2025

Published in Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0305004124000409

zbMATH Keywords

\(k\)-uniform hypergraph\(q\)-colour Ramsey number

Mathematics Subject Classification ID

Distance in graphs (05C12) Generalized Ramsey theory (05C55) Hypergraphs (05C65) Ramsey theory (05D10)

Cites work

• scientific article; zbMATH DE number 3869331 (Why is no real title available?)
• scientific article; zbMATH DE number 3494449 (Why is no real title available?)
• scientific article; zbMATH DE number 3506748 (Why is no real title available?)
• A combinatorial problem in geometry.
• A conjecture of Erdős on graph Ramsey numbers
• Combinatorial Theorems on Classifications of Subsets of a Given Set
• Density theorems for bipartite graphs and related Ramsey-type results
• Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
• On a problem of K. Zarankiewicz
• On a problem of formal logic.
• On extremal problems of graphs and generalized graphs
• On graphs with linear Ramsey numbers
• On two problems in graph Ramsey theory
• Partition relations for cardinal numbers
• Ramsey numbers of degenerate graphs
• Ramsey numbers of sparse hypergraphs
• Recent developments in graph Ramsey theory
• Some remarks on the theory of graphs
• The Ramsey number of a graph with bounded maximum degree

Cited in

(1)

• Lower bounds for Ramsey numbers of bounded degree hypergraphs

This page was built for publication: Ramsey numbers of hypergraphs with a given size

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