The Construction of Certain Graphs

From MaRDI portal
Publication:5589878

DOI10.4153/CJM-1962-060-4zbMath0194.25304OpenAlexW2065634598MaRDI QIDQ5589878

C. A. Rogers, Paul Erdős

Publication date: 1962

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1962-060-4




Related Items (33)

Subgraphs in vertex neighborhoods ofKr-free graphsOn decomposition of graphsTurán-Ramsey theorems and simple asymptotically extremal structuresOn the minimum degree of minimal Ramsey graphs for multiple coloursGlobally sparse vertex‐ramsey graphsOn the Ramsey-Turán number with small \(s\)-independence numberLocal-Global Phenomena in GraphsConstructive bounds for a Ramsey-type problemGraphentheoretische ExtremalproblemeBounding Ramsey numbers through large deviation inequalitiesKs-Free Graphs Without Large Kr-Free SubgraphsClique-factors in graphs with sublinear -independence numberQuasiplanar graphs, string graphs, and the Erdős-Gallai problemOn vertex Ramsey graphs with forbidden subgraphsA Ramsey–Turán theory for tilings in graphsOn the Ramsey-Turán numbers of graphs and hypergraphsOn generalized Ramsey numbers of Erdős and RogersOn \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbersGraphs without large triangle free subgraphsEmbedding Graphs into Larger Graphs: Results, Methods, and Problems\(K_4\)-free graphs without large induced triangle-free subgraphsShort Proofs of Some Extremal ResultsWhen does the K4‐free process stop?An almost quadratic bound on vertex Folkman numbersRemarks on generic stability in independent theoriesLarge Kr‐free subgraphs in Ks‐free graphs and some other Ramsey‐type problemsDependent random choiceOn a Ramsey--Turán Variant of the Hajnal--Szemerédi TheoremOn the minimal number of edges in color-critical graphsOn a bound of Graham and Spencer for a graph-colouring constantOn Generalized Ramsey Numbers for 3‐Uniform HypergraphsZur Geometrie der KreislagerungenOn the Stability of the Graph Independence Number




This page was built for publication: The Construction of Certain Graphs