Size Ramsey number of bipartite graphs and bipartite Ramanujan graphs
From MaRDI portal
Publication:5135729
DOI10.22108/toc.2019.111317.1573zbMath1463.05375OpenAlexW2948996280MaRDI QIDQ5135729
Publication date: 23 November 2020
Full work available at URL: https://doaj.org/article/4eb5dec16a264aee9c8163147cc5b6e4
Cites Work
- Unnamed Item
- Unnamed Item
- The size Ramsey number
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Recent developments in graph Ramsey theory
- A partition calculus in set theory
- Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes
- On size Ramsey number of paths, trees, and circuits. I
- On the Size-Ramsey Number of Cycles
- On some Multicolor Ramsey Properties of Random Graphs
- An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths
This page was built for publication: Size Ramsey number of bipartite graphs and bipartite Ramanujan graphs