COMB-002
Solved
L4
The Erdős-Faber-Lovász Conjecture
Category:Combinatorics
267 views
22 favorites
Problem Statement
Background
Problem Solved
Solved: Jan 1, 2021
Solution Reference:
Kang, D. Y., Kelly, T., Kühn, D., Methuku, A., & Osthus, D. (2021). Graph and hypergraph colouring via nibble methods.
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.
Discussion features coming soon!