scientific article; zbMATH DE number 3506748
From MaRDI portal
Publication:4087229
Recommendations
Cited in
(34)- The Borsuk dimension of a graph and Borsuk's partition conjecture for finite sets
- New upper bound for multicolor Ramsey number of odd cycles
- An upper bound on the Ramsey number of trees
- Multicolour Ramsey numbers of odd cycles
- Gallai-Ramsey number of odd cycles with chords
- Exact values of multicolor Ramsey numbers \(R_l(C_{\le l+1})\)
- Exact Ramsey numbers of odd cycles via nonlinear optimisation
- Class Ramsey numbers of odd cycles in many colors
- Exact Ramsey numbers in multipartite graphs arising from Hadamard matrices and strongly regular graphs
- Splits with forbidden subgraphs
- scientific article; zbMATH DE number 5989953 (Why is no real title available?)
- The multicolour Ramsey number of a long odd cycle
- scientific article; zbMATH DE number 4162925 (Why is no real title available?)
- On minimal arbitrarily partitionable graphs
- A note on the Size-Ramsey number of long subdivisions of graphs
- Ramsey properties of randomly perturbed graphs: cliques and cycles
- A conjecture of Erdős on graph Ramsey numbers
- On multigraphs with a given partition
- scientific article; zbMATH DE number 966836 (Why is no real title available?)
- scientific article; zbMATH DE number 4187852 (Why is no real title available?)
- Ramsey-type numbers involving graphs and hypergraphs with large girth
- On the Erdős–Sós conjecture for trees with bounded degree
- Characterizing the supernorm partition statistic
- Ramsey numbers for multiple copies of sparse graphs
- The power of many colours
- Ordered Ramsey numbers of graphs with m edges
- Multipartite Ramsey numbers of double stars
- Ramsey and Gallai-Ramsey numbers of cycles and books
- Ramsey numbers of hypergraphs with a given size
- Short monochromatic odd cycles
- An improved upper bound for the multicolour Ramsey number of odd cycles
- Combinatorics. Abstracts from the workshop held January 4--9, 2026
- On the multicolor Ramsey number of a graph with m edges
- Covering the complete graph by partitions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4087229)
