arXiv (All)
open access
Random independent sets in triangle-free and linear Berge-$C_4$-free hypergraphs
We study probability distributions on independent sets of uniform hypergraphs with local constraints. For a positive vertex-weight function $w$ on an $(r+1)$-uniform hypergraph, define the weighted degree of vertex $v$ by \[ d_w(v):= \sum_{e\ni v} \left( \prod_{u\in e\setminus\{v\}}\dfrac{w(u)}{w(v)
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Erdős Matching Conjecture for 4-uniform hypergraphs#1070833
- A Necessary and Sufficient Hall Condition for Hypergraphs#615173
- A Necessary and Sufficient Hall Condition for Hypergraphs#614206
- Two-color Ramsey lower bounds for bounded degree hypergraphs#1083062
- Inverse knapsack at two capacities: which pairs of value-cardinality hulls are realizable?#1064672
Record · ID 1215601
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive