Generalized Erdős-Rogers problems for hypergraphs

DOI10.1016/J.EJC.2026.104372MaRDI QIDQ7293101zbMATH OpenFDO

Authors Xiaoyu He, Jiaxi Nie

Publication date 9 July 2026

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2026.104372

Mathematics Subject Classification ID

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

Cites work

• A note on Ramsey numbers
• Hypergraph Ramsey numbers
• Improved bounds for the Erdős-Rogers (s, s+2)-problem
• Independent sets in hypergraphs with a forbidden link
• Induced subgraphs of K_r-free graphs and the Erdős-Rogers problem
• Large K_r‐free subgraphs in K_s‐free graphs and some other Ramsey‐type problems
• On generalized Ramsey numbers for 3-uniform hypergraphs
• On off-diagonal hypergraph Ramsey numbers
• On the maximum F-free induced subgraphs in K_t-free graphs
• On the order of the classical Erdős-Rogers functions
• Recent developments in graph Ramsey theory
• The asymptotics of r(4,t)
• The Construction of Certain Graphs
• The probabilistic method
• The Ramsey number R(3, t) has order of magnitude t²/log t
• When are off-diagonal hypergraph Ramsey numbers polynomial?

This page was built for publication: Generalized Erdős-Rogers problems for hypergraphs

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