Randomly Perturbed Graphs And Rainbow Connectivity

Document Type

Presentation Abstract

Presentation Date

5-13-2022

Abstract

This defense will examine the following random graph model: for an arbitrary dense graph H, construct a graph G by randomly adding m edges to H and randomly coloring the edges of G with r colors. In 2019 Anastos and Frieze conjectured that for m a large enough constant and r ≥ 5, every pair of vertices in G are joined by a rainbow path, hence G is rainbow connected. My defense will prove that this conjecture is true and entertain related questions.

Additional Details

Doctoral Dissertation Defense. Link to the presenter's dissertation.

May 13, 2022 at 3:00 p.m. Math 103

This document is currently not available here.

Share

COinS