Add to ORKGWe use the theory of flag algebras to find new upper bounds for several small graph and hypergraph Ramsey numbers. In particular, we prove the exact values R(K−, K−, K−) = 28, R(K8, C5) = 29, R(K9, C6) = 41, R(Q3, Q3) = 13, R(K3,5, K1,6) = 17, R(C3, C5, C5) = 17, and R(K−, K−; 3) = 12, and in addition improve many additional upper bounds
AbstractThe Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertice...
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
For positive integer s and t, the Ramsey number R(s, t) is the least positive integer n such that fo...
We present a fully computer-assisted proof system for solving a particular family of problems in Ext...
We present data which, to the best of our knowledge, includes all known nontrivial values and bounds...
We give an exponential improvement to the lower bound on diagonal Ramsey numbers for any fixed numbe...
The theory of flag algebras is a systematic method developed by Razborov to tackle problems in the f...
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring...
The Ramsey number r(G) of a graph G is the smallest number n such that, in any two-colouring of the ...
In this note, we revisit the problem of calculating small on-line Ramsey numbers R(G,H). A new appro...
Given a finite set P of points from R^d, a k-ary semi-algebraic relation E on P is the set of k-tupl...
The Ramsey number $R(r, b)$ is the least positive integer such that every edge 2-coloring of the com...
These are the supplementary files for the paper “New Ramsey Multiplicity Bounds and Search Heuristic...
AbstractSome of the counting arguments used by Kalbfleisch in a paper published in the January, 1967...
Using computational techniques we derive six new upper bounds on the classical two-color Ramsey numb...
AbstractThe Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertice...
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
For positive integer s and t, the Ramsey number R(s, t) is the least positive integer n such that fo...
We present a fully computer-assisted proof system for solving a particular family of problems in Ext...
We present data which, to the best of our knowledge, includes all known nontrivial values and bounds...
We give an exponential improvement to the lower bound on diagonal Ramsey numbers for any fixed numbe...
The theory of flag algebras is a systematic method developed by Razborov to tackle problems in the f...
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring...
The Ramsey number r(G) of a graph G is the smallest number n such that, in any two-colouring of the ...
In this note, we revisit the problem of calculating small on-line Ramsey numbers R(G,H). A new appro...
Given a finite set P of points from R^d, a k-ary semi-algebraic relation E on P is the set of k-tupl...
The Ramsey number $R(r, b)$ is the least positive integer such that every edge 2-coloring of the com...
These are the supplementary files for the paper “New Ramsey Multiplicity Bounds and Search Heuristic...
AbstractSome of the counting arguments used by Kalbfleisch in a paper published in the January, 1967...
Using computational techniques we derive six new upper bounds on the classical two-color Ramsey numb...
AbstractThe Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertice...
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
For positive integer s and t, the Ramsey number R(s, t) is the least positive integer n such that fo...