A conjecture of Erdős on graph Ramsey numbers (Q531812): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(7 intermediate revisions by 6 users not shown) | |||
Property / author | |||
Property / author: Benjamin Sudakov / rank | |||
Property / author | |||
Property / author: Benjamin Sudakov / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2121456457 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q123109593 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1002.0095 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4075489 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4382659 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Ramsey number of a graph with bounded maximum degree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new upper bound for diagonal Ramsey numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hypergraph Packing and Sparse Bipartite Ramsey Numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On two problems in graph Ramsey theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some remarks on the theory of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3337470 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4087229 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5759552 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a Ramsey type theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Induced Ramsey-type theorems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Density theorems for bipartite graphs and related Ramsey-type results / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two remarks on the Burr-Erdős conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4521487 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On bipartite graphs with linear Ramsey numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3997075 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On graphs with small Ramsey numbers. II. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Ramsey Numbers of Sparse Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4200109 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 00:21, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A conjecture of Erdős on graph Ramsey numbers |
scientific article |
Statements
A conjecture of Erdős on graph Ramsey numbers (English)
0 references
20 April 2011
0 references
The Ramsey number \(r(G)\) of a graph \(G\) is the minimum \(N\) such that every red-blue coloring of the edges of the complete graph on \(N\) vertices contains a monochromatic copy of \(G\). Confirming old conjecture of Erdős, the author proves that \(r(G)\leqslant 2^{250\sqrt{m}}\) for any graphs on \(m\) edges with no isolated vertices. The proof uses some hard density arguments. In the introduction, the author outlines the history of the conjecture.
0 references
Ramsey numbers
0 references
Erdős' conjecture
0 references