arXiv (All)
open access
Borel Kernels in Borel Directed Graphs
We prove that there is a Borel quasi-kernel in any locally countable Borel directed graph with finite Borel chromatic number. We prove that the Borel chromatic number of a Borel directed graph with bounded out-degree $n$ is either infinite or less than or equal to $\frac{(n+1)(n+2)}{2}$. This is an
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
- Uniformly Expanding Full Branch Maps with a Wild Attracting Point#821691
- Exact three-component covers in 2-coloured random bipartite graphs#1011301
- Escaping the Shadow of Bell's Theorem in Network Nonlocality#971661
- The Deterministic Broadcast Channel Revisited: A Bipartite Graph Approach#1049065
- Measuring the complexity of characterizing $[0, 1]$, $S^1$, and $\mathbb{R}$ up to homeomorphism#1233661
Record · ID 1247288
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