Matchings in Benjamini--Schramm convergent graph sequences

matching measure of a finite graph as the uniform distribution on the roots of the matching polynomial of the graph. We analyze the asymptotic behavior of the matching measure for graph sequences with bounded degree.

Saved in:
Bibliographic Details
Published in:Transactions of the American Mathematical Society 2016-06, Vol.368 (6), p.4197-4218
Main Authors: Abért, Miklós, Csikvári, Péter, Frenkel, Péter E., Kun, Gábor
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:matching measure of a finite graph as the uniform distribution on the roots of the matching polynomial of the graph. We analyze the asymptotic behavior of the matching measure for graph sequences with bounded degree.
ISSN:0002-9947
1088-6850
DOI:10.1090/tran/6464