Theory of monomer-dimer systems

From MaRDI portal

Publication:2549706

Jump to:navigation, search

DOI10.1007/BF01877590zbMath0228.05131OpenAlexW4244121195MaRDI QIDQ2549706

Ole J. Heilmann, Elliott H. Lieb

Publication date: 1972

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01877590

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items

Counting matchings via capacity-preserving operators, On the Tutte and Matching Polynomials for Complete Graphs, Approximating real-rooted and stable polynomials, with combinatorial applications, Finite-size corrections for the attractive mean-field monomer-dimer model, A Most General Edge Elimination Polynomial, Matchings in regular graphs: minimizing the partition function, A unified approach to multivariate polynomial sequences with real stability, Exclusion statistics and thermodynamics of a straight \(k\)-mers lattice-gas: analytical approximation and Monte Carlo simulations, Matching Energy of Graphs with Maximum Degree at Most 3, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Independent set and matching permutations, Enumeration of maximum matchings in the Hanoi graphs using matching polynomials, The matching polynomials of hypergraphs and weighted hypergraphs, Gap sets for the spectra of cubic graphs, Disordered monomer-dimer model on cylinder graphs, On real-rootedness of independence polynomials of rooted products of graphs, Equivariant log-concavity of graph matchings, Free boundary dimers: random walk representation and scaling limit, General position polynomials, Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial, Interactions of computational complexity theory and mathematics, Convergence of graphs with intermediate density, Signatures, Lifts, and Eigenvalues of Graphs, A note on the multiplicities of the eigenvalues of a graph, Hoste’s conjecture for generalized Fibonacci polynomials, Approximating permanents and hafnians, STATISTICAL MECHANICS OF EQUILIBRIUM AND NONEQUILIBRIUM PHASE TRANSITIONS: THE YANG–LEE FORMALISM, Asymptotic enumeration of Latin rectangles, Monomer-dimer problem on random planar honeycomb lattice, Analytic results -- lattice and continuum, A mean-field monomer-dimer model with attractive interaction: Exact solution and rigorous results, Asymptotic enumeration of Latin rectangles, A novel graph-operational matrix method for solving multidelay fractional differential equations with variable coefficients and a numerical comparative survey of fractional derivative types, Asymptotic normality of the coefficients of polynomials associated with the Gegenbauer ones, Counting over non-planar graphs, Unnamed Item, Unnamed Item, The independent set sequence of some families of trees, Open problems in the spectral theory of signed graphs, Christoffel–Darboux Type Identities for the Independence Polynomial, Unimodality of independence polynomials of rooted products of graphs, The Lee‐Yang and Pólya‐Schur programs. II. Theory of stable polynomials and applications, Developments in the theory of graph spectra, CONFIGURATIONAL ENTROPY IN GENERALIZED LATTICE-GAS MODELS, Matrix permanent and quantum entanglement of permutation invariant states, The complexity of approximating the complex-valued Potts model, Unimodality of the independence polynomials of some composite graphs, Gauges, loops, and polynomials for partition functions of graphical models, The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs, Fibonacci graphs possessing identical matching polynomials, Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs, On the roots of domination polynomial of graphs, A cluster expansion approach to the Heilmann-Lieb liquid crystal model, Central limit theorems, Lee-Yang zeros, and graph-counting polynomials, Q-counting rook configurations and a formula of Frobenius, Positivity of the virial coefficients in lattice dimer models and upper bounds on the number of matchings on graphs, Monomer-dimer problem on some networks, Clique cover products and unimodality of independence polynomials, Asymptotic normality of some graph sequences, The Lee--Yang and Pólya--Schur programs. I: Linear operators preserving stability, A Pfaffian formula for monomer-dimer partition functions, Unimodality of independence polynomials of the incidence product of graphs, Building graphs whose independence polynomials have only real roots, On some counting polynomials in chemistry, Interacting dimers on a Sierpinski gasket, Central and local limit theorems for the coefficients of polynomials associated with the Laguerre ones, Fractional v. integral covers in hypergraphs of bounded edge size, Limit theorems for monomer-dimer mean-field models with attractive potential, The matching polynomial of a polygraph, On the adjacency spectra of hypertrees, Tight bounds on the algebraic connectivity of Bethe trees, On the spectra of some weighted rooted trees and applications, The spectra of a graph obtained from copies of a generalized Bethe tree, A survey on recurrence relations for the independence polynomial of hypergraphs, Multicomplexes and polynomials with real zeros, Matchings in benzene chains, On the location of roots of independence polynomials, Graphs with few matching roots, The nematic phase of a system of long hard rods, Dual rook polynomials, The roots of the independence polynomial of a clawfree graph, Matchings on infinite graphs, On the unimodality of independence polynomials of some graphs, Enumeration of matchings in families of self-similar graphs, Generalizing Tutte's theorem and maximal non-matchable graphs, Ramanujan coverings of graphs, High-activity expansion for the columnar phase of the hard rectangle gas, Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy, Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs, Mean-field limit and phase transitions for nematic liquid crystals in the continuum, Solution of the monomer-dimer model on locally tree-like graphs. Rigorous results, The number of maximum matchings in a tree, Benjamini-Schramm continuity of root moments of graph polynomials, Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs, Two remarks on the adjoint polynomial, The characteristic polynomial and the matchings polynomial of a weighted oriented graph, The independence fractal of a graph., On generalized Fibonacci numbers and \(k\)-distance \(K_p\)-matchings in graphs, On the unimodality of independence polynomials of very well-covered graphs, A lower bound on the maximum permanent in \(\Lambda_{n}^{k}\)., Two problems on independent sets in graphs, Generalized \(D\)-graphs for nonzero roots of the matching polynomial, Paving the chessboard, The independent set sequence of regular bipartite graphs, On the roots of edge cover polynomials of graphs, Hermite polynomials and a duality relation for matchings polynomials, Spectra of weighted generalized Bethe trees joined at the root, The partition polynomial of a finite set system, Homogeneous multivariate polynomials with the half-plane property, On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree, Proof of chiral symmetry breaking in strongly coupled lattice gauge theory, Graphs with a minimal number of convex sets, Matchings in vertex-transitive bipartite graphs, On the number of \(r\)-matchings in a tree, Chromatic roots and limits of dense graphs, On the \(A_{\alpha}\)-spectra of trees, \(q\)-analogs of the inclusion-exclusion principle and permutations with restricted position, Laplace eigenvalues of graphs---a survey, Computing tight upper bounds on the algebraic connectivity of certain graphs, Lee-Yang zeros for the DHL and 2D rational dynamics. I: Foliation of the physical cylinder, Solution to a problem on skew spectral radii of oriented graphs, Pfaffian correlation functions of planar dimer covers, An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial, Bounds on the largest root of the matching polynomial, The inverse problem for certain tree parameters, A bijection theorem for domino tilings with diagonal impurities, The matching energy of a graph, On permanents and the zeros of rook polynomials, A Pfaffian formula for the monomer-dimer model on surface graphs, On the roots of Wiener polynomials of graphs, Weighted enumeration of spanning subgraphs with degree constraints, On the location of roots of graph polynomials, On the validations of the asymptotic matching conjectures, A mean-field monomer-dimer model with randomness: exact solution and rigorous results, On the stochastic independence properties of hard-core distributions, Counting unbranched subgraphs, Lee-Yang problems and the geometry of multivariate polynomials, Matchings and independent sets of a fixed size in regular graphs, An extension of the bivariate chromatic polynomial, An asymptotic independence theorem for the number of matchings in graphs, Sequential cavity method for computing free energy and surface pressure, Tree and forest weights and their application to nonuniform random graphs, Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems., The Holens-Đoković conjecture on permanents fails!, On Stanley's chromatic symmetric function and clawfree graphs, Further investigation involving rook polynomials with only real zeros, Approximating the number of monomer-dimer coverings of a lattice., The behaviour of (n over \(k,\dots ,k,n-ik)c^ i/i!\) is asymptotically normal, Computer generation of all 1-factors for a class of graphs with all vertices of degree two or three, A statistical model of current loops and magnetic monopoles, On the independence polynomial of the corona of graphs, On spectral radii of Coxeter transformations., Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices, Shift lifts preserving Ramanujan property, The complexity of approximating the complex-valued Potts model, The \(k\)-fractal of a simplicial complex, The general Albertson irregularity index of graphs, Conditional negative association for competing urns, Graphs determined by polynomial invariants, Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems, Graphs, Vectors, and Matrices, Spectra of weighted uniform hypertrees, The Density Turán Problem, A unified approach to polynomial sequences with only real zeros, Proof of chiral symmetry breaking in lattice gauge theory, On a conjecture of Wilf, Dimer coverings of 1-slab cubic lattices, One more remark on the adjoint polynomial, Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths, Zeros and approximations of holant polynomials on the complex plane, Evaluations of Tutte polynomials of regular graphs, Study of dimer-monomer on the generalized Hanoi graph, \(1/n\) expansion for the number of matchings on regular graphs and Monomer-Dimer entropy, On matching integral graphs, Unimodality of independence polynomials of the cycle cover product of graphs, On the unimodality of domination polynomials, Enumeration of substitutional isomers with restrictive mutual positions of ligands: I. Overall counts, Reflexive polytopes arising from bipartite graphs with \(\gamma\)-positivity associated to interior polynomials, Laplacian matching polynomial of graphs, Gallai-Edmonds structure theorem for weighted matching polynomial, Upper bound for the number of spanning forests of regular graphs, Using edge generating function to solve monomer-dimer problem, On the largest matching roots of graphs with a given number of pendent vertices, Statistical Matching Theory, Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy, A fast numerical method for fractional partial integro-differential equations with spatial-time delays, Polynomials with the half-plane property and matroid theory, Mean-Field Monomer-Dimer Models. A Review, State matrix recursion method and monomer-dimer problem, Different phases of a system of hard rods on three dimensional cubic lattice, On the main spectrum of generalized Bethe trees, Counting hypergraph matchings up to uniqueness threshold, Some applications of Wagner's weighted subgraph counting polynomial, Some remarks on the location of zeroes of the partition function for lattice systems, Random sampling for the monomer–dimer model on a lattice, On the Monomer–Dimer Problem of Some Graphs, Location of the eigenvalues of weighted graphs with a cut edge, On the roots of independence polynomials of almost all very well-covered graphs, Two populations mean-fields monomer-dimer model, Lee-Yang theorems and the complexity of computing averages, Random bichromatic matchings, Improved bounds for the largest eigenvalue of trees, Polynomials with real zeros and Pólya frequency sequences, Log-concavity of independence polynomials of some kinds of trees, The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma, Generalization of matching extensions in graphs -- combinatorial interpretation of orthogonal and \(q\)-orthogonal polynomials, Structure and motion of the Lee–Yang zeros, Unnamed Item, On operators on polynomials preserving real-rootedness and the Neggers-Stanley conjecture, On the Charney-Davis and Neggers-Stanley conjectures, On the roots of domination polynomials, Entropy-driven phase transition in a polydisperse hard-rods lattice system, A logician's view of graph polynomials, Matchings in Benjamini–Schramm convergent graph sequences, Counting Matchings and Tree-Like Walks in Regular Graphs, Birthday inequalities, repulsion, and hard spheres, Nematic liquid crystal phase in a system of interacting dimers and monomers, On the largest eigenvalue of a mixed graph with partial orientation, Deep Boltzmann machines: rigorous results at arbitrary depth, Symmetry breaking in Laughlin's state on a cylinder, On the Roots of σ-Polynomials, On the independent set sequence of a tree, New Graph Polynomials from the Bethe Approximation of the Ising Partition Function, Chiral limit of strongly coupled lattice gauge theories, Research problems from the 18th British Combinatorial Conference, Lower bounds on matching energy of graphs, On the numbers of independent \(k\)-sets in a claw free graph, Perron value and moment of rooted trees, Even subgraph expansions for the flow polynomial of cubic plane maps, Exact Entropy of Dimer Coverings for a Class of Lattices in Three or More Dimensions, Matchings and squarefree powers of edge ideals, Extremal matching energy and the largest matching root of complete multipartite graphs, Matching behaviour is asymptotically normal, Gibbs' Measures on Combinatorial Objects and the Central Limit Theorem for an Exponential Family of Random Trees, Generalizations of the matching polynomial to the multivariate independence polynomial, On the location of zeros of the Laplacian matching polynomials of graphs, Atoms of the matching measure, Theory of computation of multidimensional entropy with an application to the monomer-dimer problem, Weighted enumeration of spanning subgraphs in locally tree-like graphs, Spectrahedrality of hyperbolicity cones of multivariate matching polynomials, Graphs with six distinct matching roots, Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs, Bipartition polynomials, the Ising model, and domination in graphs, Bounding the largest eigenvalue of trees in terms of the largest vertex degree, Location of the Lee-Yang zeros and absence of phase transitions in some Ising spin systems, Introduction to Special Issue: In Honor of Elliott Lieb's 80th birthday, A refined Gallai-Edmonds structure theorem for weighted matching polynomials, Combinatorial explanation of coefficients of the Laplacian matching polynomial of graphs, Interlacing families. I: Bipartite Ramanujan graphs of all degrees, Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem, The matching energy of random graphs

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2549706&oldid=15289897"