Skip to main content

All Questions

Filter by
Sorted by
Tagged with
5 votes
3 answers
434 views

Can local flip moves connect dimer matchings on 'quadrangulated' planar bipartite graphs? (perfect matching reconfiguration problem)

I'm interested in the structure of dimer matchings on planar graphs with a bipartite structure. In particular, I'm interested in whether any two perfect matchings can be connected, i.e. transformed ...
Joe's user avatar
  • 545
4 votes
0 answers
154 views

Mixing time for dimers on the square-octagon graph

Consider the "fortress graph" of order $n$ (see Figure 9 of http://faculty.uml.edu/jpropp/tiling/www/mdblum/arctic.html). It's been known empirically for twenty years that if one turns the set of ...
James Propp's user avatar
  • 19.7k
3 votes
2 answers
397 views

An "incomplete" tiling?

Given an $m\times n$ chess board, we place $p$ $2\times 1$ dominoes on the board so that they don't overlap. How many ways can we place them? When each square of the board is covered by a domino this ...
JJJZZZZZ's user avatar
  • 380