10 research outputs found
Path-kipas Ramsey numbers
For two given graphs and , the Ramsey number is the smallest positive integer such that for every graph on vertices the following holds: either contains as a subgraph or the complement of contains as a subgraph. In this paper, we study the Ramsey numbers , where is a path on vertices and is the graph obtained from the join of and . We determine the exact values of for the following values of and : and ; and ( is odd, ) or ( is even, ); and or ; and or or ( with ) or ; odd and ( with ) or ( with Moreover, we give lower bounds and upper bounds for for the other values of and
On path-quasar Ramsey numbers
Let and be two given graphs. The Ramsey number is
the least integer such that for every graph on vertices, either
contains a or contains a . Parsons gave a recursive
formula to determine the values of , where is a path on
vertices and is a star on vertices. In this note, we first
give an explicit formula for the path-star Ramsey numbers. Secondly, we study
the Ramsey numbers , where is a linear forest on
vertices. We determine the exact values of for the cases
and , and for the case that has no odd component.
Moreover, we give a lower bound and an upper bound for the case and has at least one odd component.Comment: 7 page
THE ELECTRONIC JOURNAL OF COMBINATORICS (2014), DS1.14 References
and Computing 11. The results of 143 references depend on computer algorithms. The references are ordered alphabetically by the last name of the first author, and where multiple papers have the same first author they are ordered by the last name of the second author, etc. We preferred that all work by the same author be in consecutive positions. Unfortunately, this causes that some of the abbreviations are not in alphabetical order. For example, [BaRT] is earlier on the list than [BaLS]. We also wish to explain a possible confusion with respect to the order of parts and spelling of Chinese names. We put them without any abbreviations, often with the last name written first as is customary in original. Sometimes this is different from the citations in other sources. One can obtain all variations of writing any specific name by consulting the authors database of Mathematical Reviews a
Self-Evaluation Applied Mathematics 2003-2008 University of Twente
This report contains the self-study for the research assessment of the Department of Applied Mathematics (AM) of the Faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS) at the University of Twente (UT). The report provides the information for the Research Assessment Committee for Applied Mathematics, dealing with mathematical sciences at the three universities of technology in the Netherlands. It describes the state of affairs pertaining to the period 1 January 2003 to 31 December 2008
Generalized Ramsey numbers for graphs
This thesis contains new contributions to Ramsey theory, in particular results that establish exact values of graph Ramsey numbers that were unknown to date. Given two graphs F and H, the Ramsey number R(F,H) is the smallest integer N such that, for any graph G of order N, either G contains F as a subgraph, or the complement of G contains H as a subgraph.\ud
\ud
Burr showed back in 1984 that the problem of determining the exact value of R(F,H) for arbitrary graphs F and H is NP-hard. Using techniques and results from graph theory, since the early 1970s researchers have been trying to confirm the exact value of Ramsey numbers for many well-studied families of graphs, including cycles, wheels, stars, paths, trees, fans and kipases. This is the main motivation and approach behind most of the results in this thesis.\ud
\ud
The thesis contains nine chapters with new results (Chapters 2–10), together with an introductory chapter (Chapter 1). The first three of these chapters (Chapters 2, 3 and 4) deal with Ramsey numbers for cycles versus stars or wheels. The next four chapters involve Ramsey numbers for trees versus fans or wheels (Chapter 5), fans versus fans, wheels or complete graphs (Chapter 6), paths versus kipases (Chapter 7), and the union of some graphs (Chapter 8). We study planar Ramsey numbers in Chapter 9, star-critical and upper size Ramsey numbers in Chapter 10