John Kim' project in Extremal Graph Theory
[outline: Let ex(n,H) be the maximum number of edges in a n vertex graph that does
not contain H as a subgraph (i.e. ex(n,H)+1 is the minimum number of edges
that guarantees H is a subgraph).
Compute seq(ex(n,H),n=1..N) for various graphs H.]
Neil Lutz is creating a database of sequences counting
self-avoiding walks avoiding in addition certain sets as subpaths.
[Not yet ready to be posted]
Yusra Naqvi is working on binomial coefficients for Macdonald polynomials
[Not yet ready to be posted]
Nathaniel Shar is
creating a database of sequences related to linguistic extensions of Szemerédi's theorem
[Not yet ready to be posted]
Charles Wolf's project
to explore systematically C-finite representations of sequences enumerating wide classes
of forbidden patterns, with various alphabets.