On Some Open Questions for Ramsey and Folkman Numbers (Q5506775)

scientific article; zbMATH DE number 6664869

Language	Label	Description	Also known as
English	On Some Open Questions for Ramsey and Folkman Numbers	scientific article; zbMATH DE number 6664869

Statements

instance of

scholarly article

0 references

title

On Some Open Questions for Ramsey and Folkman Numbers (English)

0 references

author

Xiaodong Xu

0 references

Stanislaw P. Radziszowski

0 references

published in

Graph Theory

0 references

publication date

16 December 2016

0 references

zbMATH Keywords

multicolor Ramsey numbers

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-31940-7_4

0 references

cites work

Explicit Ramsey graphs and orthonormal labelings

0 references

Sharp bounds for some multicolour Ramsey numbers

0 references

Number-theoretical turbulence in Fermat-Euler arithmetics and large Young diagrams geometry statistics

0 references

Q3517158

0 references

The triangle-free process

0 references

Dynamic concentration of the triangle-free process

0 references

Q3684154

0 references

Q3834082

0 references

On the Ramsey numbers N(3,3,\dots ,3;2)

0 references

Q4382659

0 references

A survey of bounds for classical Ramsey numbers

0 references

A note on constructive lower bounds for the Ramsey numbers \(R(3, t)\)

0 references

Some structural properties of low-rank matrices related to computational complexity

0 references

On the Folkman Numberf(2, 3, 4)

0 references

On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers

0 references

Ramsey bounds for graph products

0 references

A lower bound for r(5, 5)

0 references

Three color Ramsey number of \(K_ 4-e\)

0 references

A lower bound for Schur numbers and multicolor Ramsey numbers

0 references

Q5463479

0 references

Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring

0 references

Notes on the Ramsey number N(3,3,3,3)

0 references

Large triangle-free subgraphs in graphs without \(K_ 4\)

0 references

Symmetric sum-free partitions and lower bounds for Schur numbers

0 references

Q4198056

0 references

Q5577106

0 references

New computational upper bounds for Ramsey numbers \(R(3,k)\)

0 references

The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\)

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

Backtrack Programming

0 references

On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon

0 references

Combinatorial Relations and Chromatic Graphs

0 references

On group partitions associated with lower bounds for symmetric Ramsey numbers

0 references

Construction of Special Edge-Chromatic Graphs

0 references

The Ramsey number R(3, t) has order of magnitude t2/log t

0 references

Some constructive bounds on Ramsey numbers

0 references

Use of MAX-CUT for Ramsey Arrowing of Triangles

0 references

On Ramsey numbers and \(K_ r\)-coloring of graphs

0 references

Explicit Construction of Small Folkman Graphs

0 references

Q4017142

0 references

Linear programming in some Ramsey problems

0 references

R(4, 5) = 25

0 references

Subgraph counting identities and Ramsey numbers

0 references

The Ramsey property for graphs with forbidden complete subgraphs

0 references

Q4393385

0 references

Q4529451

0 references

Computation of the Folkman numberFe(3, 3; 5)

0 references

Ramsey theory applications

0 references

An improved upper bound for Ramsey number \(R(3,3,3,3;2)\)

0 references

Graph Ramsey theory and the polynomial hierarchy

0 references

A note on the independence number of triangle-free graphs

0 references

The Mathematical Coloring Book

0 references

Ramsey theory. Yesterday, today, and tomorrow

0 references

Three hundred million points suffice

0 references

Dichromatic graphs and Ramsey numbers

0 references

An upper bound for the Ramsey number M(5,4)

0 references

The Ramsey number N(3,3,3,3;2)

0 references

Bounds on Shannon Capacity and Ramsey Numbers From Product of Graphs

0 references

Constructive lower bounds on classical multicolor Ramsey numbers

0 references

A constructive approach for the lower bounds on the Ramsey numbersR (s, t)

0 references

More Constructive Lower Bounds on Classical Ramsey Numbers

0 references

Identifiers

zbMATH Open document ID

1352.05125

0 references

DOI

10.1007/978-3-319-31940-7_4

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5506775