arXiv (All)
open access
When are random regular triangle-free graphs bipartite?
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 bipart
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Explosive appearance of cores and bootstrap percolation on lattices#1079639
- Distributed Symmetry Breaking on Hyperbolic Random Graphs#361429
- Nucleation and phase transition of spherical crystals and quasicrystals#1155866
- The Exact Law of Large Numbers for Independent Random Matching#21082
- Scaling limits of random plane partitions and six-vertex models#294895
Record · ID 1011670
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive