Path Ramsey numbers in multicolorings
From MaRDI portal
Publication:1845890
DOI10.1016/0095-8956(75)90080-5zbMath0286.05111OpenAlexW1990486130MaRDI QIDQ1845890
Richard H. Schelp, Ralph J. Faudree
Publication date: 1975
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(75)90080-5
Related Items
On some three-color Ramsey numbers for paths, The Turán numbers of special forests, The Turán number of disjoint copies of paths, Extremal graphs of the \(p\)th power of paths, RAMSEY NUMBERS FOR TREES, Stability in the Erdős-Gallai theorems on cycles and paths, Turán function and \(H\)-decomposition problem for gem graphs, The Ramsey number for a triple of long even cycles, An Erdős-Gallai-type theorem for keyrings, The maximum number of cliques in graphs without long cycles, Degree powers of graphs without \(B_{\ell,s}\), On the Turán number of forests, A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs, Unavoidable chromatic patterns in 2‐colorings of the complete graph, Outerplanar Turán numbers of cycles and paths, Turán numbers for disjoint paths, Extremal Problems for Hypergraph Blowups of Trees, Edges Not Covered by Monochromatic Bipartite Graph, On three-color Ramsey number of paths, On some Multicolor Ramsey Properties of Random Graphs, The maximum number of cliques in graphs with prescribed order, circumference and minimum degree, Non-Hamiltonian graphs with large minimum degree, Graphs without a Rainbow Path of Length 3, Stability of extremal connected hypergraphs avoiding Berge-paths, The complete value of the Turán number of \(3K_{p+1}\), Extremal Numbers for Odd Cycles, The edge spectrum of the saturation number for small paths, Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth, Stability in the Erdős-Gallai theorem on cycles and paths. II, Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth, The Turán number of directed paths and oriented cycles, Degree powers in graphs with a forbidden forest, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Connected graphs without long paths, On some three color Ramsey numbers for paths, cycles, stripes and stars, Rainbow Turán problems for paths and forests of stars, Maximal circuits of graphs. I, A short derivation for Turán numbers of paths, The spectral radius of graphs without paths and cycles of specified length, Generalized Ramsey theory for multiple colors, The Turán number of the graph \(2P_5\), On the multi-colored Ramsey numbers of paths and even cycles, Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number, Connected hypergraphs without long Berge-paths, Some three-color Ramsey numbers, \(R(P_4,P_5,C_k)\) and \(R(P_4,P_6,C_k)\), On the Turán number of theta graphs, Extensions of the Erdős–Gallai theorem and Luo’s theorem, The Turán number of the square of a path, On \(r\)-uniform hypergraphs with circumference less than \(r\), The Turàn number of the graph 3P4, The Turań number of \(2P_7\), Minimum degree of 3-graphs without long linear paths, Ramsey numbers for trees II, On some three color Ramsey numbers for paths and cycles, Stability results on the circumference of a graph, Planar Turán numbers of short paths, On 2-connected hypergraphs with no long cycles, Ramsey numbers for bipartite graphs with small bandwidth, Extremal graphs for two vertex-disjoint copies of a clique, Multicolour Ramsey numbers of paths and even cycles
Cites Work
