arXiv (All)
open access
On several judicious partitioning problems of graphs and hypergraphs
Judicious partition problems ask for vertex partitions of graphs or hypergraphs that optimize several quantities simultaneously. In this paper, we investigate judicious partitions of graphs and hypergraphs in which each class meets many edges and establish the following results. (1) Every hypergraph
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
- Streaming Hypergraph Coloring via Palette Sparsification#1013660
- Packing Diverse Shortest Cycles#1234196
- Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs#628834
- Random algebraic constructions for extremal and Ramsey problems#1052031
- Partitioning an $S$-packing coloring into broadcast dominating sets#1188155
Record · ID 1354484
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