On Ramsey unsaturated and saturated graphs
نویسنده
چکیده
A graph is Ramsey unsaturated if there exists a proper supergraph of the same order with the same Ramsey number, and Ramsey saturated otherwise. This has been studied by Balister, Lehel and Schelp [J. Graph Theory 51 (2006), 22–32]. In this paper, we show that some circulant graphs, trees with diameter 3, and Kt,n ∪ mK1 for infinitely many t, n and m, are Ramsey unsaturated.
منابع مشابه
A Cycle or Jahangir Ramsey Unsaturated Graphs
A graph is Ramsey unsaturated if there exists a proper supergraph of the same order with the same Ramsey number, and Ramsey saturated otherwise. We present some result concerning both Ramsey saturated and unsaturated graph. In particular, we show that a cycle Cn and a Jahangir Jm Ramsey unsaturated or saturated graphs of R(Cn,Wm) and R(Pn, Jm), respectively. We also suggest an open problems.
متن کاملRamsey unsaturated and saturated graphs
A graph is Ramsey unsaturated if there exists a proper supergraph of the same order with the same Ramsey number, and Ramsey saturated otherwise. We present some conjectures and results concerning both Ramsey saturated and unsaturated graphs. In particular, we show that cycles Cn and paths Pn on n vertices are Ramsey unsaturated for all n ≥ 5. 1 Results and Conjectures Throughout this article, r...
متن کاملAll Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملSaturation numbers for families of Ramsey-minimal graphs
Given a family of graphs F , a graph G is F-saturated if no element of F is a subgraph of G, but for any edge e in G, some element of F is a subgraph of G + e. Let sat(n,F) denote the minimum number of edges in an F -saturated graph of order n. For graphs G,H1, . . . , Hk, we write that G → (H1, . . . , Hk) if every k-coloring of E(G) contains a monochromatic copy of Hi in color i for some i. A...
متن کاملRamsey-minimal saturation numbers for matchings
Given a family of graphs F , a graph G is F-saturated if no element of F is a subgraph of G, but for any edge e in G, some element of F is a subgraph of G + e. Let sat(n,F) denote the minimum number of edges in an F-saturated graph of order n, which we refer to as the saturation number or saturation function of F . If F = {F}, then we instead say that G is F -saturated and write sat(n, F ). For...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 46 شماره
صفحات -
تاریخ انتشار 2010