A Disproof of a Conjecture of Erdős in Ramsey Theory
From MaRDI portal
Publication:3778786
DOI10.1112/jlms/s2-39.2.246zbMath0638.05037OpenAlexW2100698087WikidataQ123010580 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 graphscounterexamplesRamsey's theoremmonochromatic complete subgraphsconjecture of Erdősrandom colouring
Related Items (51)
On tripartite common graphs ⋮ Szemerédi's partition and quasirandomness ⋮ Inducibility and universality for trees ⋮ The step Sidorenko property and non-norming edge-transitive graphs ⋮ On a conjecture of Erdős for multiplicities of cliques ⋮ Threshold Ramsey multiplicity for odd cycles ⋮ Non-Three-Colourable Common Graphs Exist ⋮ Finding Patterns Avoiding Many Monochromatic Constellations ⋮ Non-bipartite \(k\)-common graphs ⋮ Multiplicities of subgraphs ⋮ Graph products and monochromatic multiplicities ⋮ An approximate version of Sidorenko's conjecture ⋮ Locally common graphs ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ Toward characterizing locally common graphs ⋮ Undecidability of polynomial inequalities in weighted graph homomorphism densities ⋮ Linear configurations containing 4-term arithmetic progressions are uncommon ⋮ A Property on Monochromatic Copies of Graphs Containing a Triangle ⋮ The number of additive triples in subsets of abelian groups ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Common graphs with arbitrary connectivity and chromatic number ⋮ Extended commonality of paths and cycles via Schur convexity ⋮ On a common-extendable, non-Sidorenko linear system ⋮ Minimum Number of Monotone Subsequences of Length 4 in Permutations ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Universality of Graphs with Few Triangles and Anti-Triangles ⋮ On the Lower Tail Variational Problem for Random Graphs ⋮ On the Ramsey multiplicity of complete graphs ⋮ Extremal results in sparse pseudorandom graphs ⋮ Edges not in any monochromatic copy of a fixed graph ⋮ Two-colorings with many monochromatic cliques in both colors ⋮ Monochromatic triangles in three-coloured graphs ⋮ Blowup Ramsey numbers ⋮ 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 ⋮ 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 ⋮ On the densities of cliques and independent sets in graphs ⋮ Anti-Ramsey Multiplicities ⋮ On the Profile of Multiplicities of Complete Subgraphs ⋮ Short proofs of some extremal results III ⋮ Using Ramsey theory to measure unavoidable spurious correlations in big data ⋮ Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs ⋮ On the 3‐Local Profiles of Graphs ⋮ Threshold Ramsey multiplicity for paths and even cycles ⋮ Effect of the Lüders plateau on ductile fracture with MBL model ⋮ Ramsey numbers of books and quasirandomness ⋮ A MAX-CORRELATION WHITE NOISE TEST FOR WEAKLY DEPENDENT TIME SERIES ⋮ The feasible region of induced graphs ⋮ On the Density of Transitive Tournaments
This page was built for publication: A Disproof of a Conjecture of Erdős in Ramsey Theory
