On Ramsey Size-Linear Graphs and Related Questions
From MaRDI portal
Abstract: In this paper we prove several results on Ramsey numbers for a fixed graph and a large graph , in particular for . These results extend earlier work of ErdH{o}s, Faudree, Rousseau and Schelp and of Balister, Schelp and Simonovits on so-called Ramsey size-linear graphs. Among others, we show that if is a subdivision of with at least vertices, then for every graph . We also conjecture that if is a connected graph with , then . The case was proved by ErdH{o}s, Faudree, Rousseau and Schelp. We prove the case .
Recommendations
Cites work
- A note on Ramsey numbers
- A note on Ramsey size-linear graphs
- A partial k-arboretum of graphs with bounded treewidth
- Asymptotic lower bounds for Ramsey functions
- Dependent random choice
- Disproof of a Conjecture of Erdős and Simonovits on the Turán Number of Graphs with Minimum Degree 3
- scientific article; zbMATH DE number 3545699 (Why is no real title available?)
- Parameters tied to treewidth
- Ramsey Size Linear Graphs
- Random graphs.
- The early evolution of the \(H\)-free process
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
This page was built for publication: On Ramsey Size-Linear Graphs and Related Questions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6141859)