On graphs with linear Ramsey numbers
From MaRDI portal
Publication:4521487
DOI<176::AID-JGT3>3.0.CO;2-C 10.1002/1097-0118(200011)35:3<176::AID-JGT3>3.0.CO;2-CzbMath0965.05073OpenAlexW4235031608WikidataQ30051715 ScholiaQ30051715MaRDI QIDQ4521487
Andrzej Ruciński, Vojtěch Rödl, Ronald L. Graham
Publication date: 23 July 2001
Full work available at URL: https://doi.org/10.1002/1097-0118(200011)35:3<176::aid-jgt3>3.0.co;2-c
graphs of bounded degreeRamsey numbers of \(p\)-arrangeable graphsRamsey numbers of bipartite graphs
Related Items
Short proofs of some extremal results. II., The tail is cut for Ramsey numbers of cubes, Graph classes with linear Ramsey numbers, On two problems in graph Ramsey theory, Ramsey good graphs with long suspended paths, Unavoidable tournaments, The Ramsey numbers of squares of paths and cycles, Ordered Ramsey numbers, Extremal results in sparse pseudorandom graphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Hypergraph Packing and Sparse Bipartite Ramsey Numbers, Monochromatic bounded degree subgraph partitions, Ramsey numbers of connected clique matchings, Induced Ramsey-type theorems, Cube Ramsey numbers are polynomial, Ramsey numbers of cubes versus cliques, The critical window for the classical Ramsey-Turán problem, A conjecture of Erdős on graph Ramsey numbers, Ramsey-goodness -- and otherwise, Erdős-Hajnal-type theorems in hypergraphs, Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs, Directed Ramsey number for trees, Dependent random choice, Ramsey numbers of sparse hypergraphs, Size bipartite Ramsey numbers, New lower bounds for classical Ramsey numbers R(5, 13) and R(5, 14), Short proofs of some extremal results III, Ramsey numbers of sparse hypergraphs, Monochromatic trees in random tournaments, Two remarks on the Burr-Erdős conjecture, Fraternal augmentations, arrangeability and linear Ramsey numbers, Cycles Are Strongly Ramsey-Unsaturated
Cites Work
- Unnamed Item
- Edge disjoint placement of graphs
- The Ramsey number of a graph with bounded maximum degree
- Induced Ramsey numbers
- Lower bounds of tower type for Szemerédi's uniformity lemma
- Ramsey numbers for sparse graphs
- Graphs with linearly bounded Ramsey numbers
- Subdivided graphs have linear ramsey numbers
