scientific article

zbMath0293.05119MaRDI QIDQ4044600

John A. G. Roberts, Stefan A. Burr

Publication date: 1973

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items

The ith Ramsey number for matchings, Unnamed Item, Ramsey numbers for local colorings, Ramsey numbers of several \(K_{t,s}\) and a large \(K_{m,n}\), Small order graph-tree Ramsey numbers, Gallai-Ramsey numbers for a class of graphs with five vertices, Multicolor star-critical Ramsey numbers and Ramsey-good graphs, Stars versus stripes Ramsey numbers, Splits with forbidden subgraphs, Edge-ordered Ramsey numbers, On the multicolor size Ramsey number of stars and cliques, Rainbow subgraphs in Hamiltonian cycle decompositions of complete graphs, The Ramsey numbers r(P\(_m\),K\(_n\)), List Ramsey numbers, Gallai-Ramsey numbers for rainbow paths, On the Ramsey numbers of trees with small diameter, Problems close to my heart, A note on the Ramsey number of stars -- complete graphs, Multicolor Ramsey numbers for triple systems, Some multicolor bipartite Ramsey numbers involving cycles and a small number of colors, On the Ramsey multiplicity for stars, Unnamed Item, Constrained Ramsey numbers for rainbow matching, On multicolour noncomplete Ramsey graphs of star graphs, Ramsey numbers of ordered graphs, On zero-sum Ramsey numbers--stars, A new method to prove and find analytic inequalities, On the Erdős-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings, On multicolor Ramsey numbers for complete bipartite graphs, Stars and their \(k\)-Ramsey numbers, Some generalized bipartite Ramsey numbers involving short cycles, On the Ramsey numbers for stars versus complete graphs, Ramsey-type results for Gallai colorings, Deleting edges from Ramsey graphs, Maximum subgraphs in Ramsey graphs, Set and size multipartite Ramsey numbers for stars, Some bistar bipartite Ramsey numbers, Ramsey Graphs and Block Designs. I, A Ramsey-type problem for paths in digraphs, Generalised Ramsey numbers for small graphs, On generalized Ramsey numbers for trees, The third Ramsey numbers for graphs with at most four edges