arXiv (All)
open access
Counting Successor-Closed Subsets of Functional Digraphs
A functional digraph is a directed graph where each vertex has an out-degree of at most 1. We study the number of successor-closed subsets of a functional digraph, that is, subsets from which no edge leaves. We show that functional digraphs have a simple recursive formula for their corresponding gen
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
- Counting Successor-Closed Subsets of Functional Digraphs#789918
- Path Enumeration by Position-Visit Counts in Recombining Trinomial Trees#1076754
- The Maximum Number of Shortest Paths in Graphs#924228
- The Maximum Number of Shortest Paths in Graphs#919997
- Multiset Colorings of Random Graphs Across Density Regimes#1049104
Record · ID 793937
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