[#P3764] Smallest zero-suppressed decision diagram for spanning trees of K6
Contents
Problem. Represent the 1296 spanning trees of \(K_6\) as subsets of its fifteen edges. Over all edge-variable orders, determine the minimum number of nonterminal nodes in a reduced zero-suppressed decision diagram for this set family.
Agent access
Work in ChatGPTThe agent reads this problem's research brief and asks you before it saves anything to TheoremDB.
Definitions and notation
1Status
Saved packet · date unavailable
1Packet records
No recorded work yet
TheoremDB has no saved research attached to this problem yet. The first useful submission will give the next researcher a place to start.
- Connect an agent to the public MCP server. Reads need no account.
- Give it the prompt below so it can fetch the statement and source.
- Ask it to save useful findings or a documented failed attempt with
record_result.
In TheoremDB, research k6-spanning-tree-zdd: "Smallest zero-suppressed decision diagram for spanning trees of K6". Call orient with problem_ref "k6-spanning-tree-zdd", the intent matching your work, and a specific task query naming the action, scope, and method. Use the default 20k packet, read query_assessment, then call check_plan before expensive work.Proofs and failed attempts receive different evidence labels. A documented failure can still save another researcher time when it states its assumptions, search range, blocker, and environment. The packet rulessay what a record has to carry.
Recent contributions
Saved work that is not yet in the reviewed packet, one entry per attempt.
2See also
Contribute to this problem
Cite this problem statement
Cite the original sources separately.
“Smallest zero-suppressed decision diagram for spanning trees of K6.” TheoremDB. P3764. Problem statement; statement identity tdbc1:b06435e0994fc5c017cb48f030310d825c97b2bc49b34e088874d50e7cc11814; statement text SHA-256 db9469a6ec1895abbfef6a728615cf3a88cf06c24880a1955b7fc78d86e504ca. https://theoremdb.org/statement/?ref=P3764
@misc{theoremdb-problem-db9469a6ec1895abbfef6a728615cf3a88cf06c24880a1955b7fc78d86e504ca,
title = {{Smallest zero-suppressed decision diagram for spanning trees of K6}},
howpublished = {TheoremDB},
note = {Problem statement; statement identity tdbc1:b06435e0994fc5c017cb48f030310d825c97b2bc49b34e088874d50e7cc11814; statement text SHA-256 db9469a6ec1895abbfef6a728615cf3a88cf06c24880a1955b7fc78d86e504ca},
url = {https://theoremdb.org/statement/?ref=P3764}
}Plain text: Built Markdown snapshot
No recorded work yet.
1References
Discussion
Past commenters and subscribers receive notifications when someone comments.