Ramsey's theorem - a new lower bound
From MaRDI portal
Publication:1213441
Cites work
Cited in
(64)- On group partitions associated with lower bounds for symmetric Ramsey numbers
- Asymptotic lower bounds for Ramsey functions
- The probability method: Successes and limitations
- Bipartite Ramsey numbers for graphs of small bandwidth
- A note on on-line Ramsey numbers of stars and paths
- On 1-subdivisions of transitive tournaments
- A note on multicolor Ramsey number of small odd cycles versus a large clique
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
- Two problems in graph Ramsey theory
- On the rank of the distance matrix of graphs
- Lower bounds for multicolor Ramsey numbers
- Blowup Ramsey numbers
- Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded
- Sketchy tweets: ten minute conjectures in graph theory
- On nowhere dense graphs
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
- Upper bounds for Erdös-Hajnal coefficients of tournaments
- On the minimum degree of minimal Ramsey graphs for multiple colours
- A precise threshold for quasi-Ramsey numbers
- On classes of graphs determined by forbidden subgraphs
- Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs
- Large unavoidable subtournaments
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Ramsey, paper, scissors
- A new upper bound for the bipartite Ramsey problem
- On two problems in graph Ramsey theory
- Lower bounds for r₂(K₁ + G) and r₃(K₁ + G) from Paley graph and generalization
- SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY
- scientific article; zbMATH DE number 908143 (Why is no real title available?)
- An improved lower bound on multicolor Ramsey numbers
- Ramsey properties of randomly perturbed graphs: cliques and cycles
- Linear-sized independent sets in random cographs and increasing subsequences in separable permutations
- Threshold Ramsey multiplicity for odd cycles
- Counting Small Induced Subgraphs Satisfying Monotone Properties
- Rolling backwards can move you forward: on embedding problems in sparse expanders
- Minimal Ramsey graphs with many vertices of small degree
- A general framework for hypergraph coloring
- Ramsey numbers of connected clique matchings
- SLOW P-POINT ULTRAFILTERS
- The triangle-free process and the Ramsey number \(R(3,k)\)
- Minimum degrees and codegrees of Ramsey-minimal 3-uniform hypergraphs
- Large unavoidable subtournaments
- Triangular Ramsey numbers
- The Ramsey number of the clique and the hypercube
- Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problem
- On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles
- Ordered Ramsey numbers
- The minimum degree of minimal Ramsey graphs for cliques
- Down‐set thresholds
- Bounds on Ramsey games via alterations
- The asymptotics of r(4,t)
- Ramsey numbers for multiple copies of sparse graphs
- On the use of senders for asymmetric tuples of cliques in Ramsey theory
- Ramsey numbers of sparse digraphs
- Interview with Alan Frieze
- Ramsey numbers through the lenses of polynomial ideals and Nullstellensätze
- Ramsey simplicity of random graphs
- An algebraic perspective on Ramsey numbers
- Size-Ramsey numbers of graphs with maximum degree three
- Off-diagonal Ramsey numbers for slowly growing hypergraphs
- Disconnected common graphs via supersaturation
- An exponential improvement for Ramsey lower bounds
- On the multicolor Ramsey number of a graph with m edges
- Unavoidable subgraphs of colored graphs
This page was built for publication: Ramsey's theorem - a new lower bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1213441)
