Indexed metadata

When are random regular triangle-free graphs bipartite?

Gregory DeCamillis, Pu Gao

Source record

Source: arXiv

Published: Sep 16, 2026

arXiv: 2609.17958

Open original source ↗

Source abstract

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

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

When are random regular triangle-free graphs bipartite? — Mathematical Frontier Network