
Linkage for the end of an academic year
The Spring term just ended at UCI (we’re on a quarter system, so we run later into June and then start up again later in September than most other US universities). I haven’t yet turned in my grades, but I can already feel summer setting in.

Dancing arcquadrilaterals
Several of my past papers concern Lombardi drawing, which I and my coauthors named after conspiracytheory artist Mark Lombardi. In this style of drawing, edges are drawn as circular arcs, and must meet at equal angles around every vertex. Not every graph has such a drawing, but many symmetrical graphs do (example below: the smallest zerosymmetric graph with only two edge orbits).

A little knowledge can make the next step harder
Suppose you have a fillintheunknowns puzzle, like Sudoku. Can making some deductions and filling in those parts of the puzzle make the whole thing harder to solve than it was before you started? Sometimes, yes!

Linkage
 No maths for Europe (). Sadly, the EU parliament has passed up a chance to find a nice (or even notsonice) formula for its apportionment of seats to countries, instead opting for backroom deals and numbers pulled out of a hat.

Shattering and quasipolynomiality
An inadequatelyexplained phenomenon in computational complexity theory is that there are so few natural candidates for intermediate problems, problems in but neither in nor complete. Of course, if there are none, and the dichotomy theorem implies that there are no intermediate Boolean constraint satisfaction problems. But there are a lot of other types of problems in , and a theorem of Ladner^{1} shows that there should be an infinite hierarchy of degrees of hardness within . So where are all the members of this hierarchy, and why are they so shy?

Ladner, Richard (1975), “On the structure of polynomial time reducibility”, J. ACM 22 (1): 155–171. ↩


More matchingmimicking networks
My paper with Vijay Vazirani on parallel matching (soon to appear in SPAA) is based on the idea of a “matchingmimicking network”. If is a graph with a designated set of terminal vertices, then a matchingmimicking network for is another graph with the same terminals that has the same pattern of matchings. Here, by a pattern of matchings, I mean a family of subsets of , the subsets that can be covered by a matching that also covers all nonterminal vertices. We included a messy case analysis that, after some simplifications due to symmetry, had 21 cases for the matching mimicking networks on at most three terminals.

Congratulations, Dr. Tillman!
Today I participated in the successful dissertation defense of Bálint Tillman, a student of Athina Markopoulou in the UCI Graduate Program in Networked Systems.

Linkage
 El poema de los números primos (). Exhibit of the mathematicallyinspired artworks of Esther Ferrer, at Tabakalera in San Sebastián, Spain.

Playing with model trains and calling it graph theory
You’ve probably played with model trains, for instance with something like the Brio set shown below.^{1} And if you’ve built a layout with a model train set, you may well have wondered: is it possible for my train to use all the parts of my track?

Searching on tineye finds that this image was on Amazon in 2008. Presumably it was supplied to them by Brio? ↩


Linkage
 Good article, terrible headline (). Bill Gasarch rants about several recent instances of clickbaity, inaccurate, and overhyped media coverage of theoretical computer science topics. I suspect the answer to his question “is it just our field?” is no.
subscribe via RSS