Indexed metadata
When are random regular triangle-free graphs bipartite?
Gregory DeCamillis, Pu Gao
Source abstract
We study the structure of random -regular triangle-free graphs and show that a sharp phase transition occurs at . For smaller , asymptotically almost surely the graph is non-bipartite, whereas for greater , 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.