On Generalized Ramsey Numbers for 3‐Uniform Hypergraphs

DOI10.1002/jgt.21760zbMath1300.05170arXiv1309.4518OpenAlexW1646261625WikidataQ114236178 ScholiaQ114236178MaRDI QIDQ5495882

Andrzej Dudek, Dhruv Mubayi

Publication date: 7 August 2014

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.4518

zbMATH Keywords

Ramsey numbersuniform hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Generalized Ramsey theory (05C55)

Related Items (5)

On the minimum degree of minimal Ramsey graphs for multiple colours ⋮ On the Ramsey-Turán number with small \(s\)-independence number ⋮ Some remarks on vertex Folkman numbers for hypergraphs ⋮ On generalized Ramsey numbers of Erdős and Rogers ⋮ On the Stability of the Graph Independence Number

Cites Work

• On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers
• On a packing and covering problem
• Graphs without large triangle free subgraphs
• Constructive bounds for a Ramsey-type problem
• A new lower bound for a Ramsey-type problem
• Hypergraph Ramsey numbers
• K^s-Free Graphs Without Large K^r-Free Subgraphs
• Large K_r‐free subgraphs in K_s‐free graphs and some other Ramsey‐type problems
• Bounding Ramsey numbers through large deviation inequalities
• On the independence number of sparse graphs
• The Construction of Certain Graphs
• Combinatorial Theorems on Classifications of Subsets of a Given Set

This page was built for publication: On Generalized Ramsey Numbers for 3‐Uniform Hypergraphs