Previous |  Up |  Next

Article

Title: Note on Ramsey numbers and self-complementary graphs (English)
Author: Rödl, Vojtěch
Author: Šiňajová, Edita
Language: English
Journal: Mathematica Slovaca
ISSN: 0139-9918
Volume: 45
Issue: 3
Year: 1995
Pages: 243-249
.
Category: math
.
MSC: 05C55
idZBL: Zbl 0852.05065
idMR: MR1361817
.
Date available: 2009-09-25T11:07:01Z
Last updated: 2012-08-01
Stable URL: http://hdl.handle.net/10338.dmlcz/130475
.
Reference: [1] BURLING J. P., REYNER S. W.: Some lower bounds of the Ramsey numbers n(k, k).J. Combin. Theory Ser. B 13 (1972), 168-169. MR 0302462
Reference: [2] CHVÁTAL V., ERDÖS P., HEDRLÍN Z.: Ramsey's Theorem an self-complementary graphs.Discrete Math. 3 (1972), 301-304. MR 0313119
Reference: [3] CLAPHAM C. R. J.: A class of self-complementary graphs and lower bounds of some Ramsey numbers.J. Graph Theory 3 (1979), 287-289. Zbl 0414.05035, MR 0542550
Reference: [4] ERDÖS P.: Some remarks on the theory of graphs.Bull. Amer. Math. Soc. 53 (1974), 292-294. MR 0019911
Reference: [5] ERDÖS P., SPENCER J.: Probabilistic Methods in Combinatorics.Akadémiai Kiadó, Budapest, 1974. MR 0382007
Reference: [6] GREENWOOD R. E., GLEASON A. M.: Combinatorial relations and chromatic graphs.Canad. J. Math. 7 (1955), 1-7. Zbl 0064.17901, MR 0067467
Reference: [7] RINGEL G.: Selbstkomplementare Graphen.Arch. Math. (Basel) 14 (1963), 354-358. MR 0154273
Reference: [8] SACHS H.: Über selbstkomplementare Graphen.Publ. Math. Debrecen 9 (1962), 270-288. MR 0151953
Reference: [9] SPENCER J.: Ramsey's Theorem - a new lower bound.J. Combin. Theory Ser. A 18 (1978), 108-115. MR 0366726
.

Files

Files Size Format View
MathSlov_45-1995-3_4.pdf 722.5Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo