Author

Miklós Bóna

0 works0 citationsORCID

Recent research

  • AI & ComputingOpen access

    On the intersection of pairs of trees

    We consider the number of common edges in two independent random spanning trees of a graph $G$. For complete graphs $K_n$, we give a new proof of the fact, originally obtained by Moon, that the distribution converges to a Poisson distribution with expected value $2$. This is appl...

    European Journal of Combinatorics2026-09-090 citationsDOI