Schweser–Stiebitz–Toft questions on 3-critical hypergraphs
This entry tracks Schweser–Stiebitz–Toft questions on 3-critical hypergraphs.
It settles a structural classification and shows that hyperwheels and Hajós joins do not suffice.
Latest development
The relevant hypergraphs are characterized through odd cycles, labeled-tree families, and admissible Toft splits, with an exact split-cut criterion.
Editorial caveat
The result is reported in an unrefereed preprint.
References
- Three-critical hypergraphs of maximum local edge connectivity two — arXiv — Jun Yue
Source: arXiv
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.