arXiv (All)
open access
$(k,n)$-core percolation on hypergraphs with anchor nodes
Hypergraphs describe higher-order interactions that involve more than a pair of nodes. A characteristic feature of hypergraphs is that their robustness can be strongly affected by the different roles of the nodes. Indeed, some nodes might be essential for a hyperedge's function, while others might n
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
- Proper conflict-free choosability of sparse graphs with girth at least seven#998793
- A maximum matching based refinement of Brouwers conjecture#1070156
- On the Classical and Parameterized Complexity of Strong Odd Coloring#1156713
- On $k$-limited domination: complexity and Sierpiński graphs#1156855
- A note on efficient k-limited broadcast domination in graphs#659009
Record · ID 1155300
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