On the size-Ramsey number of grid graphs
From MaRDI portal
Publication:5886105
DOI10.1017/S0963548320000322MaRDI QIDQ5886105
Meysam Miralaei, Anusch Taraz, Damian Reding, Mathias Schacht, Dennis Clemens
Publication date: 30 March 2023
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.06915
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparse partition universal graphs for graphs of bounded degree
- Small subsets inherit sparse \(\varepsilon\)-regularity
- On graphs with small subgraphs of large chromatic number
- Expanding graphs contain all small trees
- On the combinatorial problems which I would most like to see solved
- The size Ramsey number
- Szemerédi’s Regularity Lemma for Sparse Graphs
- Regular pairs in sparse random graphs I
- On size Ramsey number of paths, trees, and circuits. I
- The Induced Size-Ramsey Number of Cycles
- On the Size-Ramsey Number of Cycles
- The size‐Ramsey number of powers of paths
- On some Multicolor Ramsey Properties of Random Graphs
- An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths
- Path Ramsey Number for Random Graphs
- Powers of Hamilton Cycles in Pseudorandom Graphs
- The size-Ramsey number of trees
- On size Ramsey numbers of graphs with bounded degree