Dirac-type Theorems for Inhomogenous Random Graphs
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911825743839232 |
|---|---|
| author | Ganesan, Ghurumuruhan |
| author_facet | Ganesan, Ghurumuruhan |
| contents | In this paper, we study Dirac-type theorems for an inhomogenous random graph (G) whose edge probabilities are not necessarily all the same. We obtain sufficient conditions for the existence of Hamiltonian paths and perfect matchings, in terms of the \emph{sum} of edge probabilities. For edge probability assignments with two-sided bounds, we use Pósa rotation and single vertex exclusion techniques to show that (G) is Hamiltonian with high probability. For weaker one-sided bounds, we use bootstrapping techniques to obtain a perfect matching in (G,) with high probability. We also highlight an application of our results in the context of channel assignment problem in wireless networks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_02267 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Dirac-type Theorems for Inhomogenous Random Graphs Ganesan, Ghurumuruhan Probability Combinatorics In this paper, we study Dirac-type theorems for an inhomogenous random graph (G) whose edge probabilities are not necessarily all the same. We obtain sufficient conditions for the existence of Hamiltonian paths and perfect matchings, in terms of the \emph{sum} of edge probabilities. For edge probability assignments with two-sided bounds, we use Pósa rotation and single vertex exclusion techniques to show that (G) is Hamiltonian with high probability. For weaker one-sided bounds, we use bootstrapping techniques to obtain a perfect matching in (G,) with high probability. We also highlight an application of our results in the context of channel assignment problem in wireless networks. |
| title | Dirac-type Theorems for Inhomogenous Random Graphs |
| topic | Probability Combinatorics |
| url | https://arxiv.org/abs/2404.02267 |