The following pages link to (Q5605168):
Displaying 50 items.
- Odd \(K_{3,3}\) subdivisions in bipartite graphs (Q256986) (← links)
- Bipartite dimer representation of squares of 2d-Ising correlations (Q294301) (← links)
- On the asymptotics of dimers on tori (Q343799) (← links)
- Chiral flavors and M2-branes at toric CY\({}_4\) singularities (Q360845) (← links)
- Pfaffian graphs embedding on the torus (Q382787) (← links)
- The parity of a thicket (Q405214) (← links)
- The walk distances in graphs (Q427888) (← links)
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650) (← links)
- Discrete Dirac operators on Riemann surfaces and Kasteleyn matrices (Q437817) (← links)
- Counting dimer coverings on self-similar Schreier graphs (Q444407) (← links)
- A collapse theorem for holographic algorithms with matchgates on domain size at most 4 (Q476175) (← links)
- The Pfaffian property of circulant graphs (Q479041) (← links)
- Asymptotics of random lozenge tilings via Gelfand-Tsetlin schemes (Q483307) (← links)
- Face-width of Pfaffian braces and polyhex graphs on surfaces (Q490246) (← links)
- Discrete Dirac operators, critical embeddings and Ihara-Selberg functions (Q490310) (← links)
- Counting the number of perfect matchings in \(K_{5}\)-free graphs (Q503455) (← links)
- Signed lozenge tilings (Q510315) (← links)
- Local statistics of realizable vertex models (Q543376) (← links)
- Resonance structure counts in parallelogram-like benzenoids with holes (Q552034) (← links)
- Matchings in benzene chains (Q594902) (← links)
- Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem (Q602719) (← links)
- \(P\) versus \(NP\) and geometry (Q607059) (← links)
- \(q\)-distributions on boxed plane partitions (Q607471) (← links)
- On the optimality of the Arf invariant formula for graph polynomials (Q610678) (← links)
- Holographic algorithms: from art to science (Q619900) (← links)
- The critical \(Z\)-invariant Ising model via dimers: Locality property (Q623347) (← links)
- Phased graphs and graph energies (Q645132) (← links)
- Signature theory in holographic algorithms (Q652529) (← links)
- An expression for the perfect matching number of cubic \(2\times m\times n\) lattices and their asymptotic values (Q679048) (← links)
- Alternating-sign matrices and domino tilings. II (Q685998) (← links)
- Spin systems on \(k\)-regular graphs with complex edge functions (Q690458) (← links)
- Dimers, tilings and trees (Q705883) (← links)
- The graph bottleneck identity (Q719327) (← links)
- The Tutte-Potts connection in the presence of an external magnetic field (Q719787) (← links)
- Spanning trees of 3-uniform hypergraphs (Q720597) (← links)
- The free-fermionic \(C_2^{(1)}\) loop model, double dimers and Kashaev's recurrence (Q721056) (← links)
- The Pfaffian sign theorem for the dimer model on a triangular lattice (Q721780) (← links)
- Generalizing the divisibility property of rectangle domino tilings (Q726665) (← links)
- Double handled brane tilings (Q737728) (← links)
- The combinatorics of N. G. de Bruijn (Q740470) (← links)
- A binomial approximation method for the Ising model (Q741352) (← links)
- Non-integrable dimers: universal fluctuations of tilted height profiles (Q779641) (← links)
- Graphical condensation of plane graphs: a combinatorial approach (Q817820) (← links)
- On the theory of matchgate computations (Q841626) (← links)
- On blockwise symmetric signatures for matchgates (Q846363) (← links)
- On very sparse circulant \((0,1)\) matrices (Q855544) (← links)
- Quadri-tilings of the plane (Q863480) (← links)
- Partition function of periodic isoradial dimer models (Q880944) (← links)
- An efficient tree decomposition method for permanents and mixed discriminants (Q905704) (← links)
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs (Q911300) (← links)
