A note on pseudorandom Ramsey graphs
From MaRDI portal
Publication:6192225
DOI10.4171/jems/1359arXiv1909.01461MaRDI QIDQ6192225
Dhruv Mubayi, Jacques Verstraete
Publication date: 11 March 2024
Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.01461
Random graphs (graph-theoretic aspects) (05C80) Combinatorial aspects of finite geometries (05B25) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On generalized Ramsey numbers of Erdős and Rogers
- Generalized polygons
- Some constructive bounds on Ramsey numbers
- The early evolution of the \(H\)-free process
- A note on the independence number of triangle-free graphs
- A note on Ramsey numbers
- On the second eigenvalue of a graph
- Asymptotic lower bounds for Ramsey functions
- Polarities and \(2k\)-cycle-free graphs
- Explicit Ramsey graphs and orthonormal labelings
- Constructive bounds for a Ramsey-type problem
- Approximating the independence number via the \(\vartheta\)-function
- The size of bipartite graphs with a given girth
- Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
- Some combinatorial and geometric characterizations of the finite dual classical generalized hexagons
- Tight estimates for eigenvalues of regular graphs
- Improved bounds for the extremal number of subdivisions
- A construction for clique-free pseudorandom graphs
- Hypergraph Ramsey numbers: triangles versus cliques
- More sets, graphs and numbers. A salute to Vera Sós and András Hajnal
- Sharp bounds for some multicolour Ramsey numbers
- Topics in multiplicative number theory
- An Introduction to Incidence Geometry
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Refined estimates concerning sumsets contained in the roots of unity
- On the Extremal Number of Subdivisions
- The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
- A Sequence of Triangle-Free Pseudorandom Graphs
- Dynamic concentration of the triangle-free process
- On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
- A generalization of Turán's theorem
- A note on odd cycle-complete graph Ramsey numbers
This page was built for publication: A note on pseudorandom Ramsey graphs