Ramsey numbers and a general Erdős-Rogers function
From MaRDI portal
Publication:6611745
DOI10.1016/J.DISC.2024.114203zbMATH Open1547.05192MaRDI QIDQ6611745
Publication date: 27 September 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Hypergraphs (05C65) Generalized quadrangles and generalized polygons in finite geometry (51E12) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hypergraph containers
- A Ramsey problem of Harary on graphs with prescribed size
- A note on Ramsey numbers
- The size of bipartite graphs with a given girth
- Some combinatorial and geometric characterizations of the finite dual classical generalized hexagons
- The independence number of graphs with a forbidden cycle and Ramsey numbers
- A note on multicolor Ramsey number of small odd cycles versus a large clique
- Sharp bounds for some multicolour Ramsey numbers
- Automorphisms of unitary block designs
- Extremal problems for cycles in graphs
- Large Kr‐free subgraphs in Ks‐free graphs and some other Ramsey‐type problems
- Improved bounds for the Erdős-Rogers function
- Independent sets in hypergraphs
- The Construction of Certain Graphs
- Asymptotic upper bounds for Ramsey functions
- A note on odd cycle-complete graph Ramsey numbers
- A note on pseudorandom Ramsey graphs
- The asymptotics of \(r(4,t)\)
- Ramsey numbers and the Zarankiewicz problem
This page was built for publication: Ramsey numbers and a general Erdős-Rogers function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611745)