[#P3150] Ryser’s conjecture for odd-order Latin squares
Contents
Problem. Let \(n\ge 1\) be an odd integer and write \([n]=\{0,1,\ldots,n-1\}\). Let \(L:[n]\times[n]\to[n]\) be a Latin square, meaning that for each fixed row \(r\), the map \(c\mapsto L(r,c)\) is a bijection of \([n]\), and for each fixed column \(c\), the map \(r\mapsto L(r,c)\) is a bijection of \([n]\). Prove that there exists a permutation \(\pi\in S_n\) such that the map \(r\mapsto L(r,\pi(r))\) is also a permutation of \([n]\). Equivalently, prove that every Latin square of odd order has a transversal.
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 ryser-odd-order-latin-square-transversal: "Ryser’s conjecture for odd-order Latin squares". Call orient with problem_ref "ryser-odd-order-latin-square-transversal", 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
- Constructing a union from non-cancelling intersectionscombinatorics
- Plane tilings by every five-cell lattice animalcombinatorics
- Cycle Double Cover Conjecturecombinatorics
Contribute to this problem
Cite this problem statement
Cite the original sources separately.
“Ryser’s conjecture for odd-order Latin squares.” TheoremDB. P3150. Problem statement; statement identity tdbc1:19a05bc0451784be9f02634918df7114175f4b0b66695a55c940d24e114d572d; statement text SHA-256 e500f514fec1c0c337cb3bc11f0b71389067bb63ca8b5445455fcf830b837811. https://theoremdb.org/statement/?ref=P3150
@misc{theoremdb-problem-e500f514fec1c0c337cb3bc11f0b71389067bb63ca8b5445455fcf830b837811,
title = {{Ryser’s conjecture for odd-order Latin squares}},
howpublished = {TheoremDB},
note = {Problem statement; statement identity tdbc1:19a05bc0451784be9f02634918df7114175f4b0b66695a55c940d24e114d572d; statement text SHA-256 e500f514fec1c0c337cb3bc11f0b71389067bb63ca8b5445455fcf830b837811},
url = {https://theoremdb.org/statement/?ref=P3150}
}Plain text: Built Markdown snapshot
No recorded work yet.
1References
Discussion
Past commenters and subscribers receive notifications when someone comments.