An upper bound on the Ramsey numbers R(3,k)

DOI10.1016/0097-3165(83)90003-1zbMATH Open0529.05038OpenAlexW2063175311MaRDI QIDQ787165FDOQ787165

Authors: J. Griggs 

Publication date: 1983

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(83)90003-1

zbMATH Keywords

triangle-free graphsRamsey numberindependent set of vertices

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)

Cites Work

• Lower bounds on the independence number in terms of the degrees
• A note on Ramsey numbers
• Graph Theory and Probability. II
• A dense infinite Sidon sequence
• Title not available (Why is that?)
• Some graph theoretic results associated with Ramsey's theorem

Cited In (12)

• Randomly finding independent sets in locally sparse graphs
• On almost-equidistant sets
• The independence numbers of weighted graphs with forbidden cycles
• Interpolating between bounds on the independence number
• Independence numbers of hypergraphs with sparse neighborhoods.
• Randomized greedy algorithms for independent sets and matchings in regular graphs: exact results and finite girth corrections
• Lower bounds on the independence number in terms of the degrees
• A note on the independence number of triangle-free graphs. II
• Constructing colorings for diagrams
• A survey of bounds for classical Ramsey numbers
• A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs
• Revisiting a theorem by Folkman on graph colouring

This page was built for publication: An upper bound on the Ramsey numbers R(3,k)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q787165)