Ramsey's theorem - a new lower bound
From MaRDI portal
Publication:1213441
DOI10.1016/0097-3165(75)90071-0zbMath0296.05003OpenAlexW1992843513WikidataQ55969775 ScholiaQ55969775MaRDI QIDQ1213441
Publication date: 1975
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(75)90071-0
Related Items (57)
On 1-subdivisions of transitive tournaments ⋮ On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles ⋮ A note on multicolor Ramsey number of small odd cycles versus a large clique ⋮ On the minimum degree of minimal Ramsey graphs for multiple colours ⋮ Linear-sized independent sets in random cographs and increasing subsequences in separable permutations ⋮ Threshold Ramsey multiplicity for odd cycles ⋮ Graph theory -- a survey on the occasion of the Abel Prize for László Lovász ⋮ Two problems in graph Ramsey theory ⋮ Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs ⋮ Large unavoidable subtournaments ⋮ Counting Small Induced Subgraphs Satisfying Monotone Properties ⋮ SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY ⋮ On the rank of the distance matrix of graphs ⋮ Rolling backwards can move you forward: On embedding problems in sparse expanders ⋮ Minimal Ramsey Graphs with Many Vertices of Small Degree ⋮ On two problems in graph Ramsey theory ⋮ A General Framework for Hypergraph Coloring ⋮ A Precise Threshold for Quasi-Ramsey Numbers ⋮ The minimum degree of minimal Ramsey graphs for cliques ⋮ Lower bounds for \(r_2(K_1 + G)\) and \(r_3(K_1 + G)\) from Paley graph and generalization ⋮ Down‐set thresholds ⋮ Bounds on Ramsey games via alterations ⋮ SLOW P-POINT ULTRAFILTERS ⋮ The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘) ⋮ Sketchy tweets: ten minute conjectures in graph theory ⋮ The asymptotics of \(r(4,t)\) ⋮ On nowhere dense graphs ⋮ Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs ⋮ Large Unavoidable Subtournaments ⋮ On group partitions associated with lower bounds for symmetric Ramsey numbers ⋮ On classes of graphs determined by forbidden subgraphs ⋮ Ordered Ramsey numbers ⋮ Lower bounds for multicolor Ramsey numbers ⋮ Blowup Ramsey numbers ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Unavoidable subgraphs of colored graphs ⋮ Ramsey numbers for multiple copies of sparse graphs ⋮ Ramsey numbers of sparse digraphs ⋮ On the use of senders for asymmetric tuples of cliques in Ramsey theory ⋮ Ramsey numbers of connected clique matchings ⋮ Bipartite Ramsey numbers for graphs of small bandwidth ⋮ The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma ⋮ Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded ⋮ Asymptotic lower bounds for Ramsey functions ⋮ Triangular Ramsey Numbers ⋮ On the multicolor Ramsey number of a graph with \(m\) edges ⋮ Interview with Alan Frieze ⋮ A note on on-line Ramsey numbers of stars and paths ⋮ A new upper bound for the bipartite Ramsey problem ⋮ Ramsey, Paper, Scissors ⋮ An improved lower bound on multicolor Ramsey numbers ⋮ The Ramsey number of the clique and the hypercube ⋮ Ramsey properties of randomly perturbed graphs: cliques and cycles ⋮ Unnamed Item ⋮ The probability method: Successes and limitations ⋮ Upper Bounds for Erdös-Hajnal Coefficients of Tournaments ⋮ Unnamed Item
Cites Work
This page was built for publication: Ramsey's theorem - a new lower bound
