The size‐Ramsey number of cubic graphs

DOI10.1112/blms.12682zbMath1521.05114arXiv2110.01897OpenAlexW3204532083MaRDI QIDQ6051389

Miloš Trujić, David Conlon, Rajko Nenadov

Publication date: 20 September 2023

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.01897

zbMATH Keywords

random graphsuniversal graphsregularity Lemmainheritance of regularity

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the KŁR conjecture in random graphs
• Hypergraph containers
• Sparse partition universal graphs for graphs of bounded degree
• The Ramsey number of a graph with bounded maximum degree
• Small subsets inherit sparse \(\varepsilon\)-regularity
• Expanding graphs contain all small trees
• Spanning subgraphs of random graphs
• The size Ramsey number
• On \(K^ 4\)-free subgraphs of random graphs
• The multicolour size-Ramsey number of powers of paths
• \(K_4\)-free subgraphs of random graphs revisited
• 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
• Threshold Functions for Ramsey Properties
• The size‐Ramsey number of powers of bounded degree trees
• The size-Ramsey number of 3-uniform tight paths
• The size‐Ramsey number of powers of paths
• Independent sets in hypergraphs
• Almost‐spanning universality in random graphs
• 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 short subdivisions

This page was built for publication: The size‐Ramsey number of cubic graphs