๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Ramsey numbers for transitive tournaments

โœ Scribed by S.A. Choudum; B. Ponnusamy


Book ID
108316323
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
156 KB
Volume
206
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Ramsey numbers for triples
โœ H.L. Abbott; A.C. Liu ๐Ÿ“‚ Article ๐Ÿ“… 1975 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 852 KB
Ramsey Numbers for Matroids
โœ Talmage James Reid ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 233 KB
On Ramsey numbers for circuits
โœ H.L Abbott ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 184 KB
Ramsey numbers for local colorings
โœ A. Gyรกrfรกs; J. Lehel; R. H. Schelp; ZS. Tuza ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Springer Japan ๐ŸŒ English โš– 759 KB
Upper bounds for Ramsey numbers
โœ Lingsheng Shi ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 207 KB
Ramsey numbers for sparse graphs
โœ Nancy Eaton ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 512 KB

We consider a class of graphs on n vertices, called (d,f)-arrangeable graphs. This class of graphs contains all graphs of bounded degree d, and all df-arrangeable graphs, a class introduced by Chen and Schelp in 1993. In 1992, a variation of the Regularity Lemma of Szemer6di was introduced by Eaton