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