A Disproof of a Conjecture of Erdős in Ramsey Theory
From MaRDI portal
Publication:3778786
DOI10.1112/jlms/s2-39.2.246zbMath0638.05037WikidataQ123010580 ScholiaQ123010580MaRDI QIDQ3778786
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
extremal graphs; counterexamples; Ramsey's theorem; monochromatic complete subgraphs; conjecture of Erdős; random colouring
Related Items
On the Density of Transitive Tournaments, The number of additive triples in subsets of abelian groups, On the 3‐Local Profiles of Graphs, On the Ramsey multiplicity of complete graphs, Two-colorings with many monochromatic cliques in both colors, Monochromatic triangles in three-coloured graphs, On the number of monotone sequences, A note on the inducibility of 4-vertex graphs, Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems, An approximate version of Sidorenko's conjecture, 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs, Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs, Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs, Graph products and monochromatic multiplicities, Multiplicities of subgraphs, On a conjecture of Erdős for multiplicities of cliques, Extremal results in sparse pseudorandom graphs, Non-Three-Colourable Common Graphs Exist, Finding Patterns Avoiding Many Monochromatic Constellations, Szemerédi's partition and quasirandomness
