A Disproof of a Conjecture of Erdős in Ramsey Theory

DOI10.1112/JLMS/S2-39.2.246zbMATH Open0638.05037OpenAlexW2100698087WikidataQ123010580 ScholiaQ123010580MaRDI QIDQ3778786FDOQ3778786

Authors: Andrew Thomason

Publication date: 1989

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s2-39.2.246

Recommendations

A conjecture of Erdős on graph Ramsey numbers
A conjecture concerning Ramsey's theorem
A counterexample to a conjecture of Erdős
scientific article; zbMATH DE number 4213982
Disproof of a conjecture in the domination theory
On a conjecture of Erdős
On a conjecture of Erdős
ON A CONJECTURE OF ERDÖS
On a conjecture of Erdős
On a conjecture of Erdős

zbMATH Keywords

extremal graphs Ramsey's theorem counterexamples monochromatic complete subgraphs random colouring conjecture of Erdős

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55)

Cited In (59)

A Property on Monochromatic Copies of Graphs Containing a Triangle
Off-diagonal commonality of graphs via entropy
Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
Extended commonality of paths and cycles via Schur convexity
On a common-extendable, non-Sidorenko linear system
On uncommon systems of equations
Undecidability of polynomial inequalities in weighted graph homomorphism densities
Linear configurations containing 4-term arithmetic progressions are uncommon
On the lower tail variational problem for random graphs
The feasible region of induced graphs
Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems
Disproof of a conjecture in the domination theory
Graph theory. Abstracts from the workshop held January 2--8, 2022
The minimum number of subgraphs in a graph and its complement
A conjecture concerning Ramsey's theorem
A max-correlation white noise test for weakly dependent time series
The step Sidorenko property and non-norming edge-transitive graphs
Edges not in any monochromatic copy of a fixed graph
Common graphs with arbitrary connectivity and chromatic number
On tripartite common graphs
Threshold Ramsey multiplicity for odd cycles
On the 3-local profiles of graphs
On the Ramsey multiplicity of complete graphs
Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
On the profile of multiplicities of complete subgraphs
Ramsey numbers involving large dense graphs and bipartite Turán numbers
2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
Ramsey numbers of books and quasirandomness
Monochromatic triangles in three-coloured graphs
Two-colorings with many monochromatic cliques in both colors
Non-bipartite \(k\)-common graphs
Discordant sets and ergodic Ramsey theory
Toward characterizing locally common graphs
Universality of graphs with few triangles and anti-triangles
Locally common graphs
Anti-Ramsey Multiplicities
Blowup Ramsey numbers
Non-three-colourable common graphs exist
On Erdős's conjecture on multiplicities of complete subgraphs: Lower upper bound for cliques of size 6
Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs
Extremal results in sparse pseudorandom graphs
Using Ramsey theory to measure unavoidable spurious correlations in big data
An approximate version of Sidorenko's conjecture
Finding Patterns Avoiding Many Monochromatic Constellations
On the densities of cliques and independent sets in graphs
Graph products and monochromatic multiplicities
Short proofs of some extremal results. III
Minimum Number of Monotone Subsequences of Length 4 in Permutations
Multiplicities of subgraphs
On the number of monotone sequences
A note on the inducibility of 4-vertex graphs
Combinatorics. Abstracts from the workshop held January 1--7, 2023
Szemerédi's partition and quasirandomness
Threshold Ramsey multiplicity for paths and even cycles
The number of additive triples in subsets of abelian groups
Effect of the Lüders plateau on ductile fracture with MBL model
Inducibility and universality for trees
On the density of transitive tournaments
On a conjecture of Erdős for multiplicities of cliques

This page was built for publication: A Disproof of a Conjecture of Erdős in Ramsey Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3778786)