arXiv (All)
open access
Random burning of the Euclidean torus
The burning number of a graph is the minimal number of steps that are needed to burn all of its vertices, with the following burning procedure: at each step, one can choose a point to set on fire, and the fire propagates constantly at unit speed along the edges of the graph. In this paper, we consid
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
- First-Order Laws for Random Geometric Graphs on the Torus#1062130
- The Murder on the Links#57964
- Distribution-uniform strong laws of large numbers#1063704
- Beyond Sparse Supervision: Diffusion-Guided Learning for Few-Shot Graph Fraud Detection#319677
- On the algorithmic complexity of twelve covering and independence parameters of graphs#652635
Record · ID 1129108
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