The Algorithmic Aspects of Uncrowded Hypergraphs
From MaRDI portal
Recommendations
- On uncrowded hypergraphs
- On the independence number of non-uniform uncrowded hypergraphs
- An Algorithmic Regularity Lemma for Hypergraphs
- On some algorithmic aspects of hypergraphic matroids
- On unavoidable hypergraphs
- Enumeration of unlabeled uniform hypergraphs
- An Algorithmic Version of the Hypergraph Regularity Method
- An algorithmic hypergraph regularity lemma
- An Algorithmic Hypergraph Regularity Lemma
Cited in
(15)- Distributions of points in \(d\) dimensions and large \(k\) -point simplices
- Distributions of points in the unit square and large \(k\)-gons
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On vertex independence number of uniform hypergraphs
- Uncrowding algorithm for hook-valued tableaux
- Large triangles in the \(d\)-dimensional unit cube
- Generalizations of Heilbronn's Triangle Problem
- No l Grid-Points in Spaces of Small Dimension
- Point sets in the unit square and large areas of convex hulls of subsets of points
- Finding Large Independent Sets in Graphs and Hypergraphs
- Exploiting a hypergraph model for finding Golomb rulers
- On sets of points that determine only acute angles
- Access balancing in storage systems by labeling partial Steiner systems
- On the independence number of non-uniform uncrowded hypergraphs
- Heilbronn triangle‐type problems in the unit square [0,1]2
This page was built for publication: The Algorithmic Aspects of Uncrowded Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4268877)
