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 Profile of Multiplicities of Complete Subgraphs, Inducibility and universality for trees, Threshold Ramsey multiplicity for odd cycles, On the Density of Transitive Tournaments, The number of additive triples in subsets of abelian groups, Minimum Number of Monotone Subsequences of Length 4 in Permutations, Universality of Graphs with Few Triangles and Anti-Triangles, On the Lower Tail Variational Problem for Random Graphs, Anti-Ramsey Multiplicities, On the 3‐Local Profiles of Graphs, On the densities of cliques and independent sets in graphs, A MAX-CORRELATION WHITE NOISE TEST FOR WEAKLY DEPENDENT TIME SERIES, On tripartite common graphs, Locally common graphs, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Toward characterizing locally common graphs, Linear configurations containing 4-term arithmetic progressions are uncommon, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, Common graphs with arbitrary connectivity and chromatic number, 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, The step Sidorenko property and non-norming edge-transitive graphs, Edges not in any monochromatic copy of a fixed graph, Multiplicities of subgraphs, Threshold Ramsey multiplicity for paths and even cycles, Ramsey numbers of books and quasirandomness, The feasible region of induced graphs, Non-bipartite \(k\)-common graphs, Blowup Ramsey numbers, Using Ramsey theory to measure unavoidable spurious correlations in big data, Effect of the Lüders plateau on ductile fracture with MBL model, On a conjecture of Erdős for multiplicities of cliques, Extremal results in sparse pseudorandom graphs, Graph theory. Abstracts from the workshop held January 2--8, 2022, Non-Three-Colourable Common Graphs Exist, Finding Patterns Avoiding Many Monochromatic Constellations, Short proofs of some extremal results III, Szemerédi's partition and quasirandomness
