On the size-Ramsey number of grids

DOI10.1017/S0963548323000147MaRDI QIDQ6632783

Could not fetch data.

Publication date: 5 November 2024

Published in: (Search for Journal in Brave)

zbMATH Keywords

random graphsRamsey theorygrid graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Sparse partition universal graphs for graphs of bounded degree
• Small subsets inherit sparse \(\varepsilon\)-regularity
• Expanding graphs contain all small trees
• Optimal labelling of a product of two paths
• The size Ramsey number
• The multicolour size-Ramsey number of powers of paths
• On an anti‐Ramsey threshold for sparse graphs with one triangle
• Local resilience of an almost spanning k‐cycle in random graphs
• On size Ramsey number of paths, trees, and circuits. I
• The Induced Size-Ramsey Number of Cycles
• The size‐Ramsey number of powers of bounded degree trees
• Rolling backwards can move you forward: On embedding problems in sparse expanders
• The size‐Ramsey number of powers of paths
• The Size Ramsey Number of Graphs with Bounded Treewidth
• On the size-Ramsey number of grid graphs
• On size Ramsey numbers of graphs with bounded degree
• The size‐Ramsey number of cubic graphs

This page was built for publication: On the size-Ramsey number of grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632783)