Recommendations
- Ramsey Problems with Bounded Degree Spread
- A strengthening of Brooks' theorem
- The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
- A bound on the total chromatic number
- Tight bounds on the clique chromatic number
- Rainbow Turán Problems
- Ramsey numbers of several \(K_{t,s}\) and a large \(K_{m,n}\)
- Asymptotically optimal frugal colouring
- Coloring the hypergraph of maximal cliques of a graph with no long path
- Monochromatic bounded degree subgraph partitions
Cites work
- Edge disjoint placement of graphs
- Graphs with linearly bounded Ramsey numbers
- scientific article; zbMATH DE number 970807 (Why is no real title available?)
- Induced Ramsey numbers
- Lower bounds of tower type for Szemerédi's uniformity lemma
- Ramsey numbers for sparse graphs
- Subdivided graphs have linear ramsey numbers
- The Ramsey number of a graph with bounded maximum degree
Cited in
(47)- Size bipartite Ramsey numbers
- Two remarks on the Burr-Erdős conjecture
- Fraternal augmentations, arrangeability and linear Ramsey numbers
- Explicit Ramsey graphs and orthonormal labelings
- Ramsey linear families and generalized subdivided graphs
- Ramsey numbers for sparse graphs
- New lower bounds for classical Ramsey numbers R(5, 13) and R(5, 14)
- Ramsey-goodness -- and otherwise
- Graphs with linearly bounded Ramsey numbers
- Ramsey good graphs with long suspended paths
- Extremal results in sparse pseudorandom graphs
- Graph classes with linear Ramsey numbers
- On graphs with small Ramsey numbers
- Cube Ramsey numbers are polynomial
- Dependent random choice
- Short proofs of some extremal results. II.
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Short proofs of some extremal results. III
- Hypergraph packing and sparse bipartite Ramsey numbers
- On two problems in graph Ramsey theory
- scientific article; zbMATH DE number 1047725 (Why is no real title available?)
- scientific article; zbMATH DE number 6813638 (Why is no real title available?)
- Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
- Monochromatic trees in random tournaments
- Monochromatic bounded degree subgraph partitions
- Ramsey numbers of connected clique matchings
- 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
- Cycles Are Strongly Ramsey-Unsaturated
- Ordered Ramsey numbers
- Ramsey numbers of sparse hypergraphs
- Ramsey numbers of sparse hypergraphs
- Induced Ramsey-type theorems
- On bipartite graphs with linear Ramsey numbers
- The Ramsey numbers of squares of paths and cycles
- Ramsey numbers for multiple copies of sparse graphs
- A remark on the Ramsey number of the hypercube
- Tiling edge-coloured graphs with few monochromatic bounded-degree graphs
- Ramsey numbers of sparse digraphs
- Ordered Ramsey numbers of graphs with m edges
- Ramsey numbers of hypergraphs with a given size
- Erdős-Hajnal-type theorems in hypergraphs
- Lower bounds for Ramsey numbers of bounded degree hypergraphs
- The tail is cut for Ramsey numbers of cubes
- Unavoidable tournaments
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
This page was built for publication: On graphs with linear Ramsey numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4521487)
