# Random matching problems on the complete graph.

Electronic Communications in Probability [electronic only] (2008)

- Volume: 13, page 258-265
- ISSN: 1083-589X

## Access Full Article

top## How to cite

topWästlund, Johan. "Random matching problems on the complete graph.." Electronic Communications in Probability [electronic only] 13 (2008): 258-265. <http://eudml.org/doc/233189>.

@article{Wästlund2008,

author = {Wästlund, Johan},

journal = {Electronic Communications in Probability [electronic only]},

keywords = {minimum matching; exponential; expectation; mean field; network},

language = {eng},

pages = {258-265},

publisher = {University of Washington},

title = {Random matching problems on the complete graph.},

url = {http://eudml.org/doc/233189},

volume = {13},

year = {2008},

}

TY - JOUR

AU - Wästlund, Johan

TI - Random matching problems on the complete graph.

JO - Electronic Communications in Probability [electronic only]

PY - 2008

PB - University of Washington

VL - 13

SP - 258

EP - 265

LA - eng

KW - minimum matching; exponential; expectation; mean field; network

UR - http://eudml.org/doc/233189

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.