On the Geometric Ramsey Number of Outerplanar Graphs
نویسندگان
چکیده
We prove polynomial upper bounds of geometric Ramsey numbers of pathwidth2 outerplanar triangulations in both convex and general cases. We also prove that the geometric Ramsey numbers of the ladder graph on 2n vertices are bounded by O(n3) and O(n10), in the convex and general case, respectively. We then apply similar methods to prove an nO(log(n)) upper bound on the Ramsey number of a path with n ordered vertices. MSC codes: 52C35, 05C55, 05C10
منابع مشابه
Structure And Properties Of Locally Outerplanar Graphs
This paper studies convex geometric graphs in which no path of length 3 self-intersects. A main result gives a decomposition of such graphs into induced outerplanar graph drawings. The resulting structure theorem is then used to compute a sharp, linear upper bound on the size of the edge set in terms of the number of vertices and the number and type of graphs in the decomposition. The paper als...
متن کاملA Note on the Structure of Locally Outerplanar Graphs
A convex geometric graph is called locally outerplanar if there is no path of length three intersects itself. In [D. Boutin, Convex Geometric Graphs with No Short Self-intersecting Path, Congressus Numerantium 160 (2003) 205–214.] and [D. Boutin, Structure and Properties of Locally Outerplanar Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 60 (2007) 169–180.], Boutin s...
متن کاملOn partitions of hereditary properties of graphs
In this paper a concept Q-Ramsey Class of graphs is introduced, where Q is a class of bipartite graphs. It is a generalization of wellknown concept of Ramsey Class of graphs. Some Q-Ramsey Classes of graphs are presented (Theorem 1 and 2). We proved that T 2, the class of all outerplanar graphs, is not D1-Ramsey Class (Theorem 3). This results leads us to the concept of acyclic reducible bounds...
متن کاملOn-line Ramsey Theory
The Ramsey game we consider in this paper is played on an unbounded set of vertices by two players, called Builder and Painter. In one move Builder introduces a new edge and Painter paints it red or blue. The goal of Builder is to force Painter to create a monochromatic copy of a fixed target graph H, keeping the constructed graph in a prescribed class G. The main problem is to recognize the wi...
متن کاملTrees on Tracks
Simultaneous embedding of planar graphs is related to the problems of graph thickness and geometric thickness. Techniques for simultaneous embedding of cycles have been used to show that the degree-4 graphs have geometric thickness at most two [3]. Simultaneous embedding techniques are also useful in visualization of graphs that evolve through time. The notion of simultaneous embedding is relat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 53 شماره
صفحات -
تاریخ انتشار 2015