An algorithmic hypergraph regularity lemma
From MaRDI portal
Recommendations
Cited in
(19)- A simple algorithm for constructing Szemerédi's regularity partition
- Permutation symmetric hypergraph states and multipartite quantum entanglement
- A tight bound for hypergraph regularity
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- An Algorithmic Version of the Hypergraph Regularity Method
- Regularity lemmas for hypergraphs and quasi-randomness
- The Algorithmic Aspects of Uncrowded Hypergraphs
- An Algorithmic Regularity Lemma for Hypergraphs
- An Algorithmic Hypergraph Regularity Lemma
- On characterizing hypergraph regularity
- Regularity Lemma for k-uniform hypergraphs
- Regularity Lemmas and Combinatorial Algorithms
- A fast new algorithm for weak graph regularity
- The hypergraph regularity method and its applications
- Approximate hypergraph partitioning and applications
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Hypergraph regularity and random sampling
- FF‐factors in Quasi‐random Hypergraphs
- Some Cubic Time Regularity Algorithms for Triple Systems
This page was built for publication: An algorithmic hypergraph regularity lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4564860)