arXiv (OAI Expanded)
open access
The Borel Distinguishing Number of Schreier Graphs
The Borel distinguishing number $D_B(\mathcal{G})$ of a Borel graph $\mathcal{G}$, recently introduced by Bilge and Kaya, is the minimum number of colors required to break the symmetry of $\mathcal{G}$ in a Borel way. In this paper, we investigate the Borel distinguishing number of Schreier graphs i
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
- Polychromatic Partitions, Kingman Theory, and Ewens Sampling Formula#793367
- Polychromatic Partitions, Kingman Theory, and Ewens Sampling Formula#789363
- Topological Signatures of Cyber-Attack Classes in Natural Visibility Graph Representations of Network Traffic#1063201
- A finite-graph conjecture related to $θ(p_c)=0$ for Bernoulli bond percolation on $\mathbb Z^d$#971895
- Two-coloring cubic graphs with small monochromatic components, but without singletons#1105452
Record · ID 1084902
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