New results on graph matching from degree preserving growth
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2022
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929612045418496 |
|---|---|
| author | Erdős, Péter L. Kharel, Shubha R. Mezei, Tamás Róbert Toroczkai, Zoltán |
| author_facet | Erdős, Péter L. Kharel, Shubha R. Mezei, Tamás Róbert Toroczkai, Zoltán |
| contents | The recently introduced \emph{Degree Preserving Growth} model (Nature Physics, \DOI{10.1038/s41567-021-01417-7}) uses matchings to insert new vertices of prescribed degrees into the current graph of an ever-growing graph sequence. The process depends both on the size of the largest available matchings, which is our focus here, as well as on the actual choice of the matching.
First we show that the question whether a graphic degree sequence, extended with a new degree $2δ$ remains graphic is closely related to the available matchings in the realizations of the sequence. Namely we prove that the extension problem is equivalent to the existence of a realization of the original degree sequence with a matching of size $δ$.
Second we present lower bounds for the \emph{forcible matching number} of degree sequences. This number is the size of the maximum matchings in any realization of the degree sequence. We then study bounds on the size of maximal matchings in \emph{some} realizations of the sequence, known as the \emph{potential matching number}. We also estimate the minimum size of both the maximal and the maximum matchings, as determined by the degree sequence, independently of graphical realizations. Along this line we answer a question raised by Biedl, Demaine \emph{et al.} (\DOI{10.1016/j.disc.2004.05.003}). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2204_07423 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | New results on graph matching from degree preserving growth Erdős, Péter L. Kharel, Shubha R. Mezei, Tamás Róbert Toroczkai, Zoltán Combinatorics 05C07, 05C70, 05C80, 05C85 G.2.1; G.2.2 The recently introduced \emph{Degree Preserving Growth} model (Nature Physics, \DOI{10.1038/s41567-021-01417-7}) uses matchings to insert new vertices of prescribed degrees into the current graph of an ever-growing graph sequence. The process depends both on the size of the largest available matchings, which is our focus here, as well as on the actual choice of the matching. First we show that the question whether a graphic degree sequence, extended with a new degree $2δ$ remains graphic is closely related to the available matchings in the realizations of the sequence. Namely we prove that the extension problem is equivalent to the existence of a realization of the original degree sequence with a matching of size $δ$. Second we present lower bounds for the \emph{forcible matching number} of degree sequences. This number is the size of the maximum matchings in any realization of the degree sequence. We then study bounds on the size of maximal matchings in \emph{some} realizations of the sequence, known as the \emph{potential matching number}. We also estimate the minimum size of both the maximal and the maximum matchings, as determined by the degree sequence, independently of graphical realizations. Along this line we answer a question raised by Biedl, Demaine \emph{et al.} (\DOI{10.1016/j.disc.2004.05.003}). |
| title | New results on graph matching from degree preserving growth |
| topic | Combinatorics 05C07, 05C70, 05C80, 05C85 G.2.1; G.2.2 |
| url | https://arxiv.org/abs/2204.07423 |