The 3/8 conjecture for 2-tight components in 2-colored 3-graphs
Consider a -edge-coloring of the complete -uniform hypergraph . Let be the largest number of -sets contained in a monochromatic -tight component, and define
The 3/8 conjecture.
This is identified in the paper as the smallest unsolved case outside the graph setting. The stated heuristic suggests improved lower bounds, but the exact value remains open.
References
- Lyuben Lichev and Sammy Luo, “Large monochromatic components in colorings of complete hypergraphs”, arXiv:2302.04487 (2023).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.