No article text was recorded for this version.
hypergraph approximation gap
Version 1 of 130 papers36 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Dense, irregular, yet always graphic $3$-uniform hypergraph degree sequences
- Blog: The Densest k-Subhypergraph Problem
- Blog: Many Cliques in Bounded-Degree Hypergraphs
- Blog: Rainbow Stackings of Random Edge-Colorings
- Blog: Disentangling Hyperedges through the Lens of Category Theory
- Blog: Statistical mechanics of the minimum vertex cover problem in stochastic block models
- Blog: A MAX-CUT formulation of 0/1 programs
- Blog: Polynomial Time Optimal Query Algorithms for Finding Graphs with Arbitrary Real Weights
- Blog: Computing hypergraph Ramsey numbers by using quantum circuit
- Blog: Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs
- Blog: Forbidden Substructures for Tractable Conjunctive Query Answering with Degree 2
- Blog: Fractional covers of hypergraphs with bounded multi-intersection
- Blog: On the expressive power of first-order boolean functions in PCF
- Blog: Exact Recovery for a Family of Community-Detection Generative Models
- Blog: Hypertree-Width and Related Hypergraph Invariants
- Blog: Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths
- Blog: Submodular Cost Allocation Problem and Applications
- Blog: Sum-of-Squares Lower Bounds for Densest k-Subgraph
- Blog: HYPERGRAPH RAMSEY NUMBERS AND ADIABATIC QUANTUM ALGORITHM
- Blog: Collaborative Clustering: Sample Complexity and Efficient Algorithms
- Blog: Sharp Impossibility Results for Hyper-graph Testing
- Blog: Distributed weak independent sets in hypergraphs: Upper and lower bounds
- Blog: The Ising Partition Function: Zeros and Deterministic Approximation
- Blog: Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning
- Blog: Evolution of Real-world Hypergraphs: Patterns and Models without Oracles
- Blog: Adaptive Neural Message Passing for Inductive Learning on Hypergraphs
- Blog: Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence
- Blog: A homogeneous polynomial associated with general hypergraphs and its applications
- Blog: Faster Counting and Sampling Algorithms using Colorful Decision Oracle
- Blog: Augmentations in Hypergraph Contrastive Learning: Fabricated and Generative
History & citation
Current · Permanent link
- This direction split from Complexity Barriers in Higher-Order Hypergraph Generalizations (53% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_hypergraph_approximation_gap_3505c681,
title = {hypergraph approximation gap},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/hypergraph-approximation-gap/rdr_3505c681df034daf97c6178ba4b02e63},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_hypergraph_approximation_gap_3505c681_v1,
title = {hypergraph approximation gap},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/hypergraph-approximation-gap/rdr_3505c681df034daf97c6178ba4b02e63/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}