Ramsey theory and strength of graphs
Rikio Ichishima, Francesc A Muntaner-Batle, Yukio Takahashi

TL;DR
This paper explores the concept of graph strength, establishes bounds related to Ramsey numbers, and investigates the sum of strengths of a graph and its complement, providing new theoretical insights and open problems.
Contribution
It introduces new bounds and exact values for the strength of graphs and their complements, extending existing conditions and connecting to Ramsey theory.
Findings
Established a lower bound for related Ramsey numbers.
Proved a sharp lower bound for the function f(n).
Provided additional lower bounds and exact values for f(n).
Abstract
A numbering of a graph of order is a labeling that assigns distinct elements of the set to the vertices of , where each is labeled . The strength of is defined by , where . Let denote the maximum of over nonempty graphs and of order , where represents the complement of . In this paper, we establish a lower bound for the Ramsey numbers related to the…
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.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Advanced Graph Theory Research
