The 1-2-3 conjecture for 3-uniform hypergraphs
Let be a hypergraph, and call it -uniform when every edge has size . A hypergraph vertex coloring is proper when every edge contains at least two vertices with distinct colors. For an edge weighting , the induced vertex color of is the sum of the weights of edges containing , and is the least such . The 1-2-3 conjecture for 3-uniform hypergraphs. For every -uniform hypergraph with no isolated edge, . This generalizes the graph 1-2-3 conjecture to 3-uniform hypergraphs.
Equivalent formulations
Let be a -uniform hypergraph without an isolated edge. A weighting induces vertex weights
The 1-2-3 Conjecture for 3-uniform hypergraphs. There is such a weighting for which the induced vertex weights properly color .
This is the -uniform analogue of the graph 1-2-3 conjecture. The source states it as an open question and gives no resolution status.
source: Maciej Kalkowski, Michał Karoński and Florian Pfender, “The 1-2-3 Conjecture for Hypergraphs”, arXiv:1308.0611 (2016).
References
Status
- Solved: Jakub Przybyło. The 1-2-3-Conjecture for 3-uniform hypergraphs (Journal of Graph Theory, 2021) https://doi.org/10.1002/jgt.22100
Source: Akbar Davoodi and Leila Maherani, “On the total versions of 1-2-3-conjecture for graphs and hypergraphs”, arXiv:2204.13936 (2022).
Progress summary
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.