Renyi Institute

There is a growing body of results in extremal combinatorics and Ramsey theory which give better bounds or stronger conclusions under the additional assumption of bounded VC-dimension. Schur and Erdős conjectured that there exists a suitable constant $c$ with the property that every graph with at least $2^{cm}$ vertices, whose edges are colored by $m$ colors, contains a monochromatic triangle. We prove this conjecture for edge-colored graphs such that the set system induced by the neighborhoods of the vertices with respect to each color class has bounded VC-dimension. This result is best possible up to the value of $c$.
    Joint work with Jacob Fox and Andrew Suk.

Knot Floer homology (introduced by Ozsvath-Szabo and independently by

Rasmussen) is a powerful tool for studying knots and links in the 3-sphere. In

particular, it gives rise to a numerical invariant, which provides a

nontrivial lower bound on the 4-dimensional genus of the knot. By deforming

the definition of knot Floer homology by a real number t from [0,2], we define

a family of homologies, and derive a family of numerical invariants with

similar properties. The resulting invariants provide a family of

homomorphisms on the concordance group. One of these homomorphisms can be

used to estimate the unoriented 4-dimensional genus of the knot. We will

review the basic constructions for knot Floer homology and the deformed

theories and discuss some of the applications. This is joint work with

P. Ozsvath and Z. Szabo.