Work

When are random regular triangle-free graphs bipartite?

Year: 2026
Type: preprint
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.
Language: English
Open Access status: green
OpenAlex ID: W7213496006
Cites: 3
Cited by:
Related to: 10