Skip to content
Preprint

When are random regular triangle-free graphs bipartite?

Sep 2026 · 0 citations
Mathematics

Abstract

We study the structure of random $d$-regular triangle-free graphs and show that a sharp phase transition occurs at $d=\frac{\sqrt 3}{2}\sqrt{n \log n}$. For smaller $d$, asymptotically almost surely the graph is non-bipartite, whereas for greater $d$, asymptotically almost surely the graph is bipartite.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.