On Some Open Questions for Ramsey and Folkman Numbers
From MaRDI portal
Publication:5506775
DOI10.1007/978-3-319-31940-7_4zbMath1352.05125OpenAlexW2535696927MaRDI QIDQ5506775
Xiaodong Xu, Stanislaw P. Radziszowski
Publication date: 16 December 2016
Published in: Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-31940-7_4
Related Items (7)
Computation of new diagonal graph Ramsey numbers ⋮ The Schur degree of additive sets ⋮ On some edge Folkman numbers, small and large ⋮ On the nonexistence of some generalized Folkman numbers ⋮ New lower bounds for 28 classical Ramsey numbers ⋮ An adaptive upper bound on the Ramsey numbers $R(3,\dots,3)$ ⋮ On a diagonal conjecture for classical Ramsey numbers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\)
- On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers
- Three color Ramsey number of \(K_ 4-e\)
- Some constructive bounds on Ramsey numbers
- Ramsey theory. Yesterday, today, and tomorrow
- The triangle-free process
- A note on the independence number of triangle-free graphs
- Large triangle-free subgraphs in graphs without \(K_ 4\)
- Three hundred million points suffice
- On group partitions associated with lower bounds for symmetric Ramsey numbers
- A note on constructive lower bounds for the Ramsey numbers \(R(3, t)\)
- The Ramsey property for graphs with forbidden complete subgraphs
- Linear programming in some Ramsey problems
- A lower bound for Schur numbers and multicolor Ramsey numbers
- Explicit Ramsey graphs and orthonormal labelings
- Subgraph counting identities and Ramsey numbers
- Notes on the Ramsey number N(3,3,3,3)
- Symmetric sum-free partitions and lower bounds for Schur numbers
- Number-theoretical turbulence in Fermat-Euler arithmetics and large Young diagrams geometry statistics
- Constructive lower bounds on classical multicolor Ramsey numbers
- An improved upper bound for Ramsey number \(R(3,3,3,3;2)\)
- New computational upper bounds for Ramsey numbers \(R(3,k)\)
- Some structural properties of low-rank matrices related to computational complexity
- Sharp bounds for some multicolour Ramsey numbers
- Ramsey bounds for graph products
- An upper bound for the Ramsey number M(5,4)
- On Ramsey numbers and \(K_ r\)-coloring of graphs
- The Ramsey number N(3,3,3,3;2)
- On the Ramsey numbers N(3,3,\dots ,3;2)
- Ramsey theory applications
- More Constructive Lower Bounds on Classical Ramsey Numbers
- A constructive approach for the lower bounds on the Ramsey numbersR (s, t)
- The Mathematical Coloring Book
- Explicit Construction of Small Folkman Graphs
- On the Folkman Numberf(2, 3, 4)
- A lower bound for r(5, 5)
- Computation of the Folkman numberFe(3, 3; 5)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- R(4, 5) = 25
- A survey of bounds for classical Ramsey numbers
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Construction of Special Edge-Chromatic Graphs
- Bounds on Shannon Capacity and Ramsey Numbers From Product of Graphs
- Use of MAX-CUT for Ramsey Arrowing of Triangles
- Dynamic concentration of the triangle-free process
- Backtrack Programming
- On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon
- Dichromatic graphs and Ramsey numbers
- Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
- Combinatorial Relations and Chromatic Graphs
- Graph Ramsey theory and the polynomial hierarchy
This page was built for publication: On Some Open Questions for Ramsey and Folkman Numbers
