Graph weights arising from Mayer's theory of cluster integrals
zbMATH Open1188.82007MaRDI QIDQ2654573FDOQ2654573
Authors: Gilbert Labelle, Pierre Leroux, Martin G. Ducharme 
Publication date: 19 January 2010
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/226465
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Graph weights arising from Mayer and Ree-Hoover theories of virial expansions
- Mayer and Ree-Hoover weights of infinite families of 2-connected graphs
- Graph weights arising from statistical mechanics
- Mayer and Ree-Hoover weights, graph invariants and bipartite complete graphs
- Solution to a combinatorial puzzle arising from Mayer's theory of cluster integrals
Trees (05C05) Exact enumeration problems, generating functions (05A15) Signed and weighted graphs (05C22) Enumeration in graph theory (05C30) Classical equilibrium statistical mechanics (general) (82B05)
Cited In (13)
- The mathematical life of Pierre Leroux
- Virial series for a system of classical particles interacting through a pair potential with negative minimum
- Graph weights arising from statistical mechanics
- A solution to the combinatorial puzzle of Mayer's virial expansion
- Mayer weights and Fourier transforms
- Mayer and Ree-Hoover weights of infinite families of 2-connected graphs
- Disagreement percolation for the hard-sphere model
- Mayer and Ree-Hoover weights, graph invariants and bipartite complete graphs
- Graph weights arising from Mayer and Ree-Hoover theories of virial expansions
- Estimates of general Mayer graphs. II. Long range behaviour of graphs with two root points occuring in the theory of ionized systems
- Estimates of general Mayer graphs. I. Construction of upper bounds for a given graph by means of sets of subgraphs. III. Upper bounds obtained by means of spanning n-trees. IV. On the computation of Gaussian integrals by star-mesh transformation
- Lower bounds for integral functionals generated by bipartite graphs
- Solution to a combinatorial puzzle arising from Mayer's theory of cluster integrals
This page was built for publication: Graph weights arising from Mayer's theory of cluster integrals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2654573)
