𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A generalization of Ramsey's theorem for regular trees

✍ Scribed by Walter Deuber


Publisher
Elsevier Science
Year
1975
Tongue
English
Weight
331 KB
Volume
18
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A generalization of a Ramsey-type theore
✍ Paul Baginski πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 93 KB

## Abstract For an __r__‐uniform hypergraph __G__ define __N__(__G__, __l__; 2) (__N__(__G__, __l__; β„€~__n__~)) as the smallest integer for which there exists an __r__‐uniform hypergraph __H__ on __N__(__G__, __l__; 2) (__N__(__G__,__l__; β„€~__n__~)) vertices with clique(__H__) < __l__ such that eve

A lower bound for Ramsey's theorem
✍ Joram Hirschfeld πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science 🌐 English βš– 291 KB

For every integer tz we denote by n the set {O, 1, . . . , n -1). We denote by En]" the collection of subsets of with exactly k elements. We call the elements of [n]" k-tuples and write thein dlown as (a,, . . . , a,) in the natural order: a, < a, c l . l < ak < n. A colouting 04 [nlk by r colours i

A generalization of TurΓ‘n's theorem
✍ Benny Sudakov; Tibor SzabΓ³; H. Van Vu πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 94 KB

## Abstract In this paper, we obtain an asymptotic generalization of TurΓ‘n's theorem. We prove that if all the non‐trivial eigenvalues of a __d__‐regular graph __G__ on __n__ vertices are sufficiently small, then the largest __K__~__t__~‐free subgraph of __G__ contains approximately (__t__β€‰βˆ’β€‰2)/(__