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

DOI10.1016/0097-3165(83)90003-1zbMath0529.05038OpenAlexW2063175311MaRDI QIDQ787165

Jerrold R. 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

Ramsey numbertriangle-free graphsindependent set of vertices

Mathematics Subject Classification ID

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

Related Items (12)

Constructing colorings for diagrams ⋮ The independence numbers of weighted graphs with forbidden cycles ⋮ A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs ⋮ On almost-equidistant sets ⋮ Independence numbers of hypergraphs with sparse neighborhoods. ⋮ A note on the independence number of triangle-free graphs. II ⋮ Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections ⋮ Interpolating between bounds on the independence number ⋮ Revisiting a theorem by Folkman on graph colouring ⋮ Lower bounds on the independence number in terms of the degrees ⋮ A survey of bounds for classical Ramsey numbers ⋮ Randomly finding independent sets in locally sparse graphs

Cites Work

• Unnamed Item
• A note on Ramsey numbers
• A dense infinite Sidon sequence
• Lower bounds on the independence number in terms of the degrees
• Graph Theory and Probability. II
• Some graph theoretic results associated with Ramsey's theorem

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