## Abstract We prove that there is an absolute constant __C__>0 so that for every natural __n__ there exists a triangleβfree __regular__ graph with no independent set of size at least \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle
A note on Ramsey size-linear graphs
β Scribed by P.N. Balister; R.H. Schelp; M. Simonovits
- Publisher
- John Wiley and Sons
- Year
- 2001
- Tongue
- English
- Weight
- 96 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
We show that if G is a Ramsey sizeβlinear graph and x,y β V (G) then if we add a sufficiently long path between x and y we obtain a new Ramsey sizeβlinear graph. As a consequence we show that if G is any graph such that every cycle in G contains at least four consecutive vertices of degree 2 then G is Ramsey sizeβlinear. Β© 2002 John Wiley & Sons, Inc. J Graph Theory 39: 1β5, 2002
π SIMILAR VOLUMES
## Abstract The __book with n pages__ __B__~__n__~ is the graph consisting of __n__ triangles sharing an edge. The __book Ramsey number__ __r__(__B__~__m__~,__B__~__n__~) is the smallest integer __r__ such that either __B__~__m__~βββ__G__ or __B__~__n__~βββ__G__ for every graph __G__ of order __r__
## Abstract An application of conservative graphs to topological graph theory is indicated.
## Abstract Coset graphs are a generalization of Cayley graphs. They arise in the construction of graphs and digraphs with transitive automorphism groups. Moreover, the consideration of coset graphs makes it possible to give an algebraic description of regular connected graphs of even degree. In th
## Abstract Let __R__(__G__) denote the minimum integer __N__ such that for every bicoloring of the edges of __K~N~__, at least one of the monochromatic subgraphs contains __G__ as a subgraph. We show that for every positive integer __d__ and each Ξ³,0β<βΞ³β<β1, there exists __k__β=β__k__(__d__,Ξ³) su