A Ramsey-type theorem for the matching number regarding connected graphs
نویسندگان
چکیده
منابع مشابه
Ramsey Number of a Connected Triangle Matching
We determine the 2-color Ramsey number of a connected triangle matching c(nK3) which is a graph with n vertex disjoint triangles plus (at least n − 1) further edges that keep these triangles connected. We obtain that R(c(nK3), c(nK3)) = 7n − 2, somewhat larger than in the classical result of Burr, Erdős and Spencer for a triangle matching, R(nK3, nK3) = 5n. The motivation is to determine the Ra...
متن کاملA Ramsey-Type Theorem for Traceable Graphs*
A graph G is traceable if there is a path passing through all the vertices of G. It is proved that every infinite traceable graph either contains arbitrarily large ftnite chordless paths, or contains a subgraph isomorphic to graph A, illustrated in the text. A corollary is that every Jinitely generated infinite lattice of length 3 contains arbitrarily large jkite fences. It is also proved that ...
متن کاملRamsey number of paths and connected matchings in Ore-type host graphs
It is well-known (as a special case of the path-path Ramsey number) that in every 2-coloring of the edges of K3n−1, the complete graph on 3n− 1 vertices, there is a monochromatic P2n, a path on 2n vertices. Schelp conjectured that this statement remains true if K3n−1 is replaced by any host graph on 3n − 1 vertices with minimum degree at least 3(3n−1) 4 . Here we propose the following stronger ...
متن کاملA note on the Ramsey number and the planar Ramsey number for C4 and complete graphs
We give a lower bound for the Ramsey number and the planar Ramsey number for C4 and complete graphs. We prove that the Ramsey number for C4 and K7 is 21 or 22. Moreover we prove that the planar Ramsey number for C4 and K6 is equal to 17.
متن کاملA Chain Theorem for 3+-Connected Graphs
4 A 3-connected graph is 3-connected if it has no 3-separation that separates a “large” fan or K3,n 5 from the rest of the graph. It is proved in this paper that, except for K4, every 3 -connected graph has 6 a 3-connected proper minor that is at most two edges away from the original graph. This result is used 7 to characterize Q-minor-free graphs, where Q is obtained from the Cube by contracti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2020
ISSN: 0012-365X
DOI: 10.1016/j.disc.2019.111648