Ask a Question

Prefer a chat interface with context about you and your work?

The Size of the Giant Joint Component in a Binomial Random Double Graph

The Size of the Giant Joint Component in a Binomial Random Double Graph

We study the joint components in a random 'double graph' that is obtained by superposing red and blue binomial random graphs on $n$~vertices. A joint component is a maximal set of vertices that supports both a red and a blue spanning tree. We show that there are critical pairs of …