arXiv (All)
open access
Random Tournaments Are Asymptotically Almost Surely Link-irregular
Bastien and Khormali (2025) conjectured that a nontrivial link-irregular tournament with $n$ vertices exists if and only if $n \ge 6$. Their work establishes the conjecture for $n \le 100$. We present a probabilistic argument for the existence of link-irregular tournaments with $n$ vertices when $n
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
- Critical oriented percolation enhanced along random supercritical horizontal lines#1354983
- Proof of the Lyons--White Conjecture#781005
- Proof of the Lyons--White Conjecture#779630
- Recurrence and transience of random walks on monotonically changing environments#1076504
- Recurrence and transience of random walks in monotonically changing environments#1258020
Record · ID 1389577
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