%0 Journal Article %1 journals/gc/TeuflW09 %A Teufl, Elmar %A Wagner, Stephan G. %D 2009 %J Graphs and Combinatorics %K dblp %N 2 %P 239-251 %T An Asymptotic Independence Theorem for the Number of Matchings in Graphs. %U http://dblp.uni-trier.de/db/journals/gc/gc25.html#TeuflW09 %V 25

@article{journals/gc/TeuflW09, added-at = {2013-05-14T00:00:00.000+0200}, author = {Teufl, Elmar and Wagner, Stephan G.}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/297b61c7dc73bcc53152669b58ae6e945/dblp}, ee = {http://dx.doi.org/10.1007/s00373-008-0832-6}, interhash = {a885bbc9f8f0e35ef00320951b2efeae}, intrahash = {97b61c7dc73bcc53152669b58ae6e945}, journal = {Graphs and Combinatorics}, keywords = {dblp}, number = 2, pages = {239-251}, timestamp = {2016-02-02T05:34:27.000+0100}, title = {An Asymptotic Independence Theorem for the Number of Matchings in Graphs.}, url = {http://dblp.uni-trier.de/db/journals/gc/gc25.html#TeuflW09}, volume = 25, year = 2009 }