[#P11526] Which Johnson graphs have Catalan clique-covering number?
Contents
Problem. Let \(J(2k,k)\) be the Johnson graph whose vertices are the k-subsets of a 2k-element set, with two vertices adjacent when their intersection has size k-1. Let theta(G) be the minimum number of cliques whose vertex sets cover V(G). For which positive integers k does theta(J(2k,k)) equal the k-th Catalan number C_k? In particular, does equality hold for every even k?
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 catalan-clique-covers-of-johnson-graphs: "Which Johnson graphs have Catalan clique-covering number?". Call orient with problem_ref "catalan-clique-covers-of-johnson-graphs", 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.
“Which Johnson graphs have Catalan clique-covering number?.” TheoremDB. P11526. Problem statement; statement identity tdbc1:e78439f9e56fdab5f88183d3b0752aea921e856cb7ae7c321db237a0a5b21b02; statement text SHA-256 3dc2db2dd48c7a2c5b13a9c4f56c07eb9250b51d6a658069730de0f32ed1e9dc. https://theoremdb.org/statement/?ref=P11526
@misc{theoremdb-problem-3dc2db2dd48c7a2c5b13a9c4f56c07eb9250b51d6a658069730de0f32ed1e9dc,
title = {{Which Johnson graphs have Catalan clique-covering number?}},
howpublished = {TheoremDB},
note = {Problem statement; statement identity tdbc1:e78439f9e56fdab5f88183d3b0752aea921e856cb7ae7c321db237a0a5b21b02; statement text SHA-256 3dc2db2dd48c7a2c5b13a9c4f56c07eb9250b51d6a658069730de0f32ed1e9dc},
url = {https://theoremdb.org/statement/?ref=P11526}
}Plain text: Built Markdown snapshot
No recorded work yet.
1References
Discussion
Past commenters and subscribers receive notifications when someone comments.