Ramsey-goodness -- and otherwise
From MaRDI portal
Publication:2259367
DOI10.1007/s00493-013-2778-4zbMath1324.05130arXiv1010.5079OpenAlexW2155870908MaRDI QIDQ2259367
Publication date: 3 March 2015
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.5079
Related Items (26)
Monochromatic cycle power partitions ⋮ Ramsey numbers of squares of paths ⋮ Ramsey goodness of paths ⋮ Ramsey good graphs with long suspended paths ⋮ A large tree is \(tK_m\)-good ⋮ The Ramsey numbers of squares of paths and cycles ⋮ Ramsey numbers involving a long path ⋮ The Ramsey number for a forest versus disjoint union of complete graphs ⋮ Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth ⋮ Calculating Ramsey Numbers by Partitioning Colored Graphs ⋮ Ramsey Goodness of Cycles ⋮ Exact Ramsey numbers of odd cycles via nonlinear optimisation ⋮ Ramsey Goodness of Bounded Degree Trees ⋮ Ramsey Goodness of Clique Versus Paths in Random Graphs ⋮ Ramsey numbers of connected clique matchings ⋮ Ramsey numbers of cubes versus cliques ⋮ On the Ramsey number of the triangle and the cube ⋮ Spanning embeddings of arrangeable graphs with sublinear bandwidth ⋮ Ramsey Number of a Connected Triangle Matching ⋮ Monochromatic square-cycle and square-path partitions ⋮ The Ramsey number of the clique and the hypercube ⋮ Cycles Are Strongly Ramsey-Unsaturated ⋮ The Size Ramsey Number of Graphs with Bounded Treewidth ⋮ Ramsey numbers for bipartite graphs with small bandwidth ⋮ Ramsey numbers of cycles versus general graphs ⋮ On the bandwidth of the Kneser graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On two problems in graph Ramsey theory
- Edge disjoint placement of graphs
- The Ramsey number of a graph with bounded maximum degree
- Proof of the bandwidth conjecture of Bollobás and Komlós
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
- Density theorems for bipartite graphs and related Ramsey-type results
- Ramsey goodness and beyond
- What can we hope to accomplish in generalized Ramsey theory ?
- All Ramsey numbers for cycles in graphs
- Asymptotic lower bounds for Ramsey functions
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Blow-up lemma
- Small Ramsey numbers
- Graphs with linearly bounded Ramsey numbers
- Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
- Ramsey numbers for cycles in graphs
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
- On maximal paths and circuits of graphs
- Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
- Hypergraph Packing and Sparse Bipartite Ramsey Numbers
- Generalizations of a Ramsey-theoretic result of chvátal
- Ramsey Numbers Involving Graphs with Long Suspended Paths
- On cycle—Complete graph ramsey numbers
- Radius two trees specify χ‐bounded classes
- On graphs with linear Ramsey numbers
- The Cycle-Complete Graph Ramsey Numbers
- On Graphs that do not Contain a Thomsen Graph
- Some remarks on the theory of graphs
- On a problem of K. Zarankiewicz
This page was built for publication: Ramsey-goodness -- and otherwise
