
TL;DR
This paper studies the Ramsey numbers of trails in graphs, establishing bounds that improve upon trivial estimates and providing new insights into the minimal graph sizes needed to guarantee trail structures.
Contribution
It introduces the concept of Ramsey numbers of trails and proves new upper and lower bounds, advancing understanding in graph Ramsey theory.
Findings
Ramsey number of trails with k vertices is at most k.
Lower bound of the Ramsey number is 2√k + Θ(1).
Improves upon the trivial upper bound of 3k/2 - 1.
Abstract
We initiate the study of Ramsey numbers of trails. Let be a positive integer. The Ramsey number of trails with vertices is defined as the the smallest number such that for every graph with vertices, or the complete contains a trail with vertices. We prove that the Ramsey number of trails with vertices is at most and at least . This improves the trivial upper bound of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
