Non-Ramsey graphs are \(c\log n\)-universal
From MaRDI portal
Publication:1818220
DOI10.1006/jcta.1999.2972zbMath0934.05090OpenAlexW1985481988MaRDI QIDQ1818220
Hans Jürgen Prömel, Vojtěch Rödl
Publication date: 9 April 2000
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.1999.2972
Related Items
For most graphs H , most H -free graphs have a linear homogeneous set, Induced subgraphs of Ramsey graphs with many distinct degrees, Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture, Combinatorics. Abstracts from the workshop held January 1--7, 2023, A bipartite version of the Erdős–McKay conjecture, Distinct degrees and homogeneous sets, Induced subgraphs of zero-divisor graphs, Induced Subgraphs With Many Distinct Degrees, The complexity of proving that a graph is Ramsey, Cliques enumeration and tree-like resolution proofs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Distinct degrees in induced subgraphs, Sizes of Induced Subgraphs of Ramsey Graphs, Induced Ramsey-type theorems, Induced Ramsey-type theorems, Erdős-Hajnal-type theorems in hypergraphs, An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs, Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal, Proof of a conjecture on induced subgraphs of Ramsey graphs, Large cliques and independent sets all over the place, Ramsey numbers of books and quasirandomness, Disjoint induced subgraphs of the same order and size
Cites Work
