The Ramsey number of a graph with bounded maximum degree
From MaRDI portal
Publication:798674
DOI10.1016/0095-8956(83)90037-0zbMATH Open0547.05044DBLPjournals/jct/ChvatalRST83OpenAlexW2160743102WikidataQ29031376 ScholiaQ29031376MaRDI QIDQ798674FDOQ798674
Authors: Vašek Chvátal, Vojtěch Rödl, William T. 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
Recommendations
Cites Work
Cited In (76)
- Ramsey numbers for multiple copies of sparse graphs
- Ramsey good graphs with long suspended paths
- Turán‐ and Ramsey‐type results for unavoidable subgraphs
- On ordered Ramsey numbers of tripartite 3-uniform hypergraphs
- Ramsey numbers of sparse digraphs
- Ramsey numbers with prescribed rate of growth
- Random bipartite Ramsey numbers of long cycles
- A note on the Size-Ramsey number of long subdivisions of graphs
- Embedding spanning subgraphs in uniformly dense and inseparable graphs
- Size Ramsey number of bounded degree graphs for games
- The Size Ramsey Number of Graphs with Bounded Treewidth
- Ramsey number of a connected triangle matching
- The size‐Ramsey number of cubic graphs
- Two extensions of Ramsey's theorem
- Cycles Are Strongly Ramsey-Unsaturated
- A unified framework for testing linear-invariant properties
- On the Ramsey number of sparse 3-graphs
- What can we hope to accomplish in generalized Ramsey theory ?
- Edge-ordered Ramsey numbers
- On graphs with small Ramsey numbers. II.
- Almost-spanning subgraphs with bounded degree in dense graphs
- Fraternal augmentations, arrangeability and linear Ramsey numbers
- Two remarks on the Burr-Erdős conjecture
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Sparse partition universal graphs for graphs of bounded degree
- On graphs with small Ramsey numbers
- Problems and results in discrete mathematics
- A Folkman linear family
- On Ramsey numbers of uniform hypergraphs with given maximum degree
- Monochromatic bounded degree subgraph partitions
- Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem
- An extension of the blow-up lemma to arrangeable graphs
- On graphs with linear Ramsey numbers
- Linear upper bounds for local Ramsey numbers
- Ramsey numbers for trees of small maximum degree
- On degree sequences forcing the square of a Hamilton cycle
- 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
- Blow-up lemma
- Monochromatic trees in random tournaments
- Vertex coverings by monochromatic cycles and trees
- On the multicolor Ramsey number of a graph with \(m\) edges
- Deterministic Graph Games and a Probabilistic Intuition
- Title not available (Why is that?)
- The bandwidth theorem for locally dense graphs
- Short proofs of some extremal results. II.
- On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs
- On two problems in graph Ramsey theory
- Local \(k\)-colorings of graphs and hypergraphs
- Ramsey numbers of sparse hypergraphs
- Bipartite Ramsey numbers of cycles for random graphs
- Extremal results in sparse pseudorandom graphs
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
- On the cover Ramsey number of Berge hypergraphs
- Ramsey numbers of ordered graphs
- Ramsey linear families and generalized subdivided graphs
- A conjecture of Erdős on graph Ramsey numbers
- Proof of the bandwidth conjecture of Bollobás and Komlós
- Minimal ordered Ramsey graphs
- Ramsey numbers for sparse graphs
- Linear Ramsey Numbers for Bounded-Degree Hypergrahps
- Ordered Ramsey numbers of loose paths and matchings
- Ramsey numbers involving graphs with large degrees
- Hypergraph packing and sparse bipartite Ramsey numbers
- Efficient graph packing via game colouring
- Ramsey numbers of sparse hypergraphs
- Title not available (Why is that?)
- Sparse multipartite graphs as partition universal for graphs with bounded degree
- On ordered Ramsey numbers of bounded-degree graphs
- Ramsey-goodness -- and otherwise
- Directed Ramsey number for trees
- Ramsey numbers of degenerate graphs
- Ordered Ramsey numbers
- Ramsey numbers of ordered graphs
- The Induced Size-Ramsey Number of Cycles
- Bipartite Ramsey numbers of paths for random graphs
This page was built for publication: The Ramsey number of a graph with bounded maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798674)
