Negative association in uniform forests and connected graphs (Q4739581): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198785 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3706275 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Percolation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probability on Trees and Networks / rank | |||
Normal rank |
Latest revision as of 18:20, 6 June 2024
scientific article; zbMATH DE number 2083474
Language | Label | Description | Also known as |
---|---|---|---|
English | Negative association in uniform forests and connected graphs |
scientific article; zbMATH DE number 2083474 |
Statements
Negative association in uniform forests and connected graphs (English)
0 references
6 August 2004
0 references
negative association
0 references
uniform forest
0 references
uniform spanning tree
0 references
uniform connected graph
0 references
0 references