Hi! I'm Martin Böhm. You can try to pronounce my surname in the correct German way, but feel free to just call me Martin. Here's my official homepage
Like 6 others, I am a member of the group of Czech students participating in the Research Experience for Undergraduates 2010 at Dimacs, Rutgers. We are from DIMATIA, Charles University in Prague .
I am studying Computer Science (undergraduate) at Faculty of Maths and Physics, Charles University.
The rest of the Czech scientific "gang" is Jozef Jirásek, Pavel Klavík, Lukáš Lánský, Lukáš Mach, Vojtěch Tůma and our student coordinator Bernard Lidický. Dan Král will visit us at DIMACS for one week.
Our advisors are Felix Lazebnik, Eric Allender.
We have received ~4 problems now, centered around algebraic graph theory and geometric approaches to graphs.
I am currently participating on work on the first problem – finding large cliques of orthomorphisms in prime-order fields using graph methods. So far we are reading through the referenced papers and books and making a picture of the task that is ahead of us.
Dan Král also brought us some problems (and he advised us on solving one of the four already mentioned). Since orthomorphisms look like a very difficult problem, I'm currently switching focus on problems centered around applying discharging on a 7-regular 7-odd-edge-cut graph in order to make it 7-edge-colourable.