AMR-030-0013
Solved
L3
Show that the discrepancy of any hypergraph H is at most c|E(H)|^(1/2)
Category:Combinatorics
Set:AMR Open Problem Lists
Beck
Problem Statement
Background
Problem status: Solved
This problem remains in the archive so its statement and resolution history stay accessible.
UnsolvedMath v1.3 research audit
Research Notes
Solved in literature
Suggested difficulty: L3
Source wording reviewed
These notes are machine-generated research aids from a supervised audit, not peer-reviewed mathematical results. Verify citations and arguments before relying on them.
Audit summary
Result
What remains
Full audit trail
Problem and source review
Literature status
Work performed
About Combinatorics: Counting problems, graph theory, discrete structures.
Discussion (0)
No comments yet. Be the first to discuss this problem!
Sign in to start the conversation.
Checking sign-in status...