Two Ramsey problems in blowups of graphs
From MaRDI portal
Publication:6568858
DOI10.1016/j.ejc.2024.103984zbMATH Open1543.0513MaRDI QIDQ6568858
Publication date: 8 July 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Cites Work
- Sparse Ramsey graphs
- Unavoidable subgraphs of colored graphs
- Unavoidable patterns
- Ramsey-minimal graphs for star-forests
- Finding unavoidable colorful patterns in multicolored graphs
- Blowup Ramsey numbers
- Extremal and Ramsey results on graph blowups
- Dependent random choice
- On a problem of K. Zarankiewicz
- Unavoidable chromatic patterns in 2‐colorings of the complete graph
- Colored unavoidable patterns and balanceable graphs
Related Items (1)
This page was built for publication: Two Ramsey problems in blowups of graphs