2022
DOI: 10.48550/arxiv.2202.02966
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Large induced distance matchings in certain sparse random graphs

Abstract: For a fixed integer k 2, let G ∈ G(n, p) be a simple connected graph on n → ∞ vertices with the expected degree d = np satisfying d c and d k−1 = o(n) for some large enough constant c. We show that the asymptotical size of any maximal collection of edges M in G such that no two edges in M are within distance k, which is called a distance k-matching, is between (k−1)n log d 4d k−1 and kn log d 2d k−1 . We also design a randomized greedy algorithm to generate one large distance k-matching in G with asymptotical … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 5 publications
(19 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?