{"paper":{"title":"Edge-connectivity and LLY curvature of hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Qing Xia","submitted_at":"2026-08-06T13:36:44Z","abstract_excerpt":"Chen, Liu, and You \\cite{ChenLiuYou2025} proved that a locally finite connected graph with positive Lin--Lu--Yau curvature has edge-connectivity equal to its minimum degree. Liu and Xia \\cite{LiuXia2026} subsequently showed that the same conclusion holds for every finite connected graph with nonnegative Lin--Lu--Yau curvature and classified all infinite exceptions. We investigate the corresponding problem for the random-walk curvature of hypergraphs introduced by Tian and Zhao \\cite{TianZhao2025}. We formulate a hypergraph analogue of the combinatorial inequality used by Liu and Xia \\cite{LiuX"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.06029","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.06029/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}