Hypergraph Ramsey numbers: triangles versus cliques

DOI10.1016/J.JCTA.2013.04.009MaRDI QIDQ2349183zbMATH OpenOpenAlexWikidataFDO

Authors Dhruv Mubayi, Alexandr Kostochka, J. Verstraëte

Publication date 19 June 2015

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcta.2013.04.009

zbMATH Keywords

hypergraphindependent setloose triangleRamsey number

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ramsey theory (05D10)

Recommendations

• Hypergraph Ramsey numbers
• The Ramsey number of loose triangles and quadrangles in hypergraphs
• Hypergraph Ramsey numbers: tight cycles versus cliques
• The Ramsey number for 3-uniform tight hypergraph cycles
• List coloring triangle-free hypergraphs

Cited in

(24)

• Triangle-free subgraphs of hypergraphs
• The Ramsey number of 3-uniform loose path versus star
• Boolean lattices: Ramsey properties and embeddings
• Multicolor Ramsey numbers for triple systems
• Hypergraph Ramsey numbers: tight cycles versus cliques
• Ramsey-type numbers involving graphs and hypergraphs with large girth
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• List coloring triangle-free hypergraphs
• Hypergraph Ramsey numbers
• Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
• Ramsey numbers for nontrivial Berge cycles
• On Ramsey numbers of hedgehogs
• On generalized Ramsey numbers for 3-uniform hypergraphs
• The minimum degree of minimal Ramsey graphs for cliques
• Combinatorics. Abstracts from the workshop held January 1--7, 2023
• Independent sets in hypergraphs omitting an intersection
• Hypergraph Ramsey numbers of cliques versus stars
• Erdős-Hajnal problem for \(H\)-free hypergraphs
• A note on pseudorandom Ramsey graphs
• The asymptotics of r(4,t)
• The growth rate of multicolor Ramsey numbers of 3-graphs
• Independent sets in hypergraphs
• Many pentagons in triple systems
• Off-diagonal Ramsey numbers for slowly growing hypergraphs

This page was built for publication: Hypergraph Ramsey numbers: triangles versus cliques

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