What type of study is this?

This is a Quantitative Study study.

October 2, 2025Open Access

Ramsey numbers of sparse graphs versus disjoint books

View Full Paper

Ask AI

Bookmark

The result establishes that r(G,tB_k)=2n+t-2 for connected graphs with n vertices and at most n(1+ε) edges.
The condition n≥111t^3k^3 ensures valid outcomes for the ramsey numbers of vertex-disjoint books.
This extends previous work by Erdős et al. regarding trees and the case when t=1.
The findings contribute to understanding ramsey numbers in the context of sparse graph structures.

No takes yet. Share an insight, caveat, or question.

This analysis shows that ramsey number r(G,tB_k) equals 2n+t-2 in sparse graphs, highlighting a key extension of earlier results.

Huang et al. (2025) studied this question.

View Full Paper

Ask AI

Bookmark