The Ramsey number of a graph with bounded maximum degree
From MaRDI portal
Publication:798674
DOI10.1016/0095-8956(83)90037-0zbMath0547.05044OpenAlexW2160743102WikidataQ29031376 ScholiaQ29031376MaRDI QIDQ798674
Václav Chvátal, Vojtěch Rödl, William T. jun. Trotter, Endre Szemerédi
Publication date: 1983
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(83)90037-0
Related Items
Linear upper bounds for local Ramsey numbers, A Folkman Linear Family, On ordered Ramsey numbers of bounded-degree graphs, What can we hope to accomplish in generalized Ramsey theory ?, Problems and results in discrete mathematics, Local \(k\)-colorings of graphs and hypergraphs, Short proofs of some extremal results. II., On Ramsey numbers of uniform hypergraphs with given maximum degree, Ramsey linear families and generalized subdivided graphs, Blow-up lemma, On two problems in graph Ramsey theory, Deterministic Graph Games and a Probabilistic Intuition, Edge-ordered Ramsey numbers, Ramsey good graphs with long suspended paths, Two extensions of Ramsey's theorem, Turán‐ and Ramsey‐type results for unavoidable subgraphs, The size‐Ramsey number of cubic graphs, Linear Ramsey Numbers for Bounded-Degree Hypergrahps, Ordered Ramsey numbers of loose paths and matchings, The Induced Size-Ramsey Number of Cycles, Ramsey numbers with prescribed rate of growth, Random bipartite Ramsey numbers of long cycles, Sparse partition universal graphs for graphs of bounded degree, On Degree Sequences Forcing The Square of a Hamilton Cycle, Ramsey numbers of ordered graphs, Ordered Ramsey numbers, Extremal results in sparse pseudorandom graphs, Bipartite Ramsey numbers of paths for random graphs, The bandwidth theorem for locally dense graphs, Vertex coverings by monochromatic cycles and trees, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Spanning 3-colourable subgraphs of small bandwidth in dense graphs, Efficient Graph Packing via Game Colouring, Hypergraph Packing and Sparse Bipartite Ramsey Numbers, Monochromatic bounded degree subgraph partitions, Sparse multipartite graphs as partition universal for graphs with bounded degree, Ramsey numbers of ordered graphs, On graphs with small Ramsey numbers*, Proof of the bandwidth conjecture of Bollobás and Komlós, A conjecture of Erdős on graph Ramsey numbers, 3-uniform hypergraphs of bounded degree have linear Ramsey numbers, Ramsey-goodness -- and otherwise, On graphs with linear Ramsey numbers, A note on the Size-Ramsey number of long subdivisions of graphs, Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs, Directed Ramsey number for trees, On the multicolor Ramsey number of a graph with \(m\) edges, Ramsey numbers of sparse hypergraphs, On the Ramsey number of sparse 3-graphs, Bipartite Ramsey numbers of cycles for random graphs, Embedding spanning subgraphs in uniformly dense and inseparable graphs, Ramsey numbers of sparse hypergraphs, Ramsey Number of a Connected Triangle Matching, A unified framework for testing linear‐invariant properties, Monochromatic trees in random tournaments, On the cover Ramsey number of Berge hypergraphs, Two remarks on the Burr-Erdős conjecture, Fraternal augmentations, arrangeability and linear Ramsey numbers, Size Ramsey Number of Bounded Degree Graphs for Games, Cycles Are Strongly Ramsey-Unsaturated, Minimal ordered Ramsey graphs, Ramsey numbers for sparse graphs, An Extension of the Blow-up Lemma to Arrangeable Graphs, Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem, Almost-spanning subgraphs with bounded degree in dense graphs, On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs
Cites Work
