49 search results - page 5 / 10 » On-line Ramsey Theory |
AML
2011
13 years 1 months ago
2011
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
RSA
2011
13 years 1 months ago
2011
: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...
TCS
2010
13 years 1 months ago
2010
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
JSYML
2007
13 years 6 months ago
2007
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
RSA
2011
13 years 1 months ago
2011
: We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small...