Induced Ramsey-type theorems
From MaRDI portal
Publication:5900433
DOI10.1016/j.aim.2008.07.009zbMath1152.05054OpenAlexW2163816204MaRDI QIDQ5900433
Publication date: 12 November 2008
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aim.2008.07.009
Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items
Short proofs of some extremal results. II., For most graphs H , most H -free graphs have a linear homogeneous set, Induced Ramsey number for a star versus a fixed graph, The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor, Excluding hooks and their complements, On two problems in graph Ramsey theory, Some recent results on Ramsey-type numbers, Strengthening Rödl's theorem, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Caterpillars in Erdős-Hajnal, A note on the Erdős-Hajnal property for stable graphs, A further extension of Rödl's theorem, A Note on Induced Ramsey Numbers, Erdős-Szekeres theorem for point sets with forbidden subconfigurations, Ordered Ramsey numbers, Extremal results in sparse pseudorandom graphs, Two Erdős-Hajnal-type theorems in hypergraphs, Symmetrized induced Ramsey theory, Erdős-Hajnal-type results for monotone paths, A conjecture of Erdős on graph Ramsey numbers, On \(k\)-partite hypergraphs with the induced \(\epsilon \)-density property, Erdős-Hajnal-type theorems in hypergraphs, The Erdös--Hajnal Conjecture for Long Holes and Antiholes, Short proofs of some extremal results III, On edge‐ordered Ramsey numbers, Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal, Large cliques and independent sets all over the place, Two remarks on the Burr-Erdős conjecture, Ramsey numbers of books and quasirandomness, The Erdős-Hajnal conjecture for paths and antipaths, Disjoint induced subgraphs of the same order and size
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new upper bound for diagonal Ramsey numbers
- Ramsey-type theorems
- Induced subgraphs of Ramsey graphs with many distinct degrees
- The Erdős-Hajnal conjecture for bull-free graphs
- Density theorems for bipartite graphs and related Ramsey-type results
- On universality of graphs with uniformly distributed edges
- Intersection theorems with geometric consequences
- Erdős and Rényi conjecture
- Induced Ramsey numbers
- The Shannon capacity of a union
- Lower bounds of tower type for Szemerédi's uniformity lemma
- On induced Ramsey numbers
- Non-Ramsey graphs are \(c\log n\)-universal
- On induced Ramsey numbers for graphs with bounded maximum degree
- On a Ramsey type theorem
- Crossing patterns of semi-algebraic sets
- 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
- Edge Distribution of Graphs with Few Copies of a Given Graph
- Cutting a graph into two dissimilar halves
- A Ramsey-Type Result for Convex Sets
- Induced subgraphs of prescribed size
- On graphs with linear Ramsey numbers
- The Induced Size-Ramsey Number of Cycles
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- Intersection patterns of curves
- Some remarks on the theory of graphs
- Quasi-random graphs
- Simulating independence
- Ramsey-type theorems with forbidden subgraphs
