On the Ramsey multiplicity of complete graphs
From MaRDI portal
(Redirected from Publication:452823)
Abstract: We show that, for large, there must exist at least [frac{n^t}{C^{(1+o(1))t^2}}] monochromatic s in any two-colouring of the edges of , where is an explicitly defined constant. The old lower bound, due to ErdH{o}s cite{E62}, and based upon the standard bounds for Ramsey's theorem, is [frac{n^t}{4^{(1+o(1))t^2}}.]
Recommendations
Cites work
- scientific article; zbMATH DE number 3188526 (Why is no real title available?)
- 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
- A Disproof of a Conjecture of Erdős in Ramsey Theory
- Multiplicities of subgraphs
- On Erdős's conjecture on multiplicities of complete subgraphs: Lower upper bound for cliques of size 6
- On Sets of Acquaintances and Strangers at any Party
- Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
Cited in
(37)- Ramsey precompact expansions of homogeneous directed graphs
- On the number of monotone sequences
- A lower bound for the Ramsey multiplicity of \(K_4\)
- Remarks on the application of Ramsey numbers to bounding the sum of densities of a graph and its complement
- Ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs
- Edges not in any monochromatic copy of a fixed graph
- Explicit Ramsey graphs and orthonormal labelings
- When is an Almost MonochromaticK4Guaranteed?
- A Canonical Ramsey Theorem for Exactly m-Coloured Complete Subgraphs
- Induced Turán numbers
- scientific article; zbMATH DE number 5942217 (Why is no real title available?)
- scientific article; zbMATH DE number 57428 (Why is no real title available?)
- scientific article; zbMATH DE number 5717180 (Why is no real title available?)
- An improved lower bound for multicolor Ramsey numbers and a problem of Erdős
- Threshold Ramsey multiplicity for paths and even cycles
- On the combinatorial structure of Rauzy graphs
- On uncommon systems of equations
- Extremal problems and results related to Gallai-colorings
- On Ramsey numbers for special complete distance graphs
- The number of additive triples in subsets of abelian groups
- Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs
- Ramsey's theorem and self-complementary graphs
- scientific article; zbMATH DE number 3882480 (Why is no real title available?)
- Ramsey for complete graphs with a dropped edge or a triangle
- Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems
- On the profile of multiplicities of complete subgraphs
- String graphs and incomparability graphs
- Short proofs of some extremal results. III
- On book-complete graph Ramsey numbers
- The shift graph and the Ramsey degree of \([\mathbb N]^\omega\)
- A note on the inducibility of 4-vertex graphs
- On highly ramsey infinite graphs
- On a conjecture of Erdős for multiplicities of cliques
- Ramsey-type problem for an almost monochromatic \(K_4\)
- Linear configurations containing 4-term arithmetic progressions are uncommon
- There exist graphs with super‐exponential Ramsey multiplicity constant
- Monochromatic triangles in three-coloured graphs
This page was built for publication: On the Ramsey multiplicity of complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452823)
