Gao–Isaev–McKay embedding conjecture for random regular graphs
Gao–Isaev–McKay embedding conjecture for random regular graphs
Let denote the uniform random labelled -regular graph. Let be integers, excluding and . Gao–Isaev–McKay embedding conjecture. There exists a coupling such that , , and
The conjecture is known in several ranges of degrees, including the regimes listed in the paper, but remains open in full generality.
Sources & referencesView supporting material
Primary source
Mikhail Isaev, Brendan D. McKay, Angus Southwell and Maksim Zhukovskii, “Sprinkling with random regular graphs”, arXiv:2309.00190 (2024).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.