An Algorithmic Regularity Lemma for Hypergraphs
From MaRDI portal
Recommendations
Cited in
(23)- Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory
- An expected polynomial time algorithm for coloring 2-colorable 3-graphs
- A deterministic algorithm for the Frieze-Kannan regularity lemma
- Weak quasi-randomness for uniform hypergraphs
- Hypergraph limits: A regularity approach
- An Algorithmic Version of the Hypergraph Regularity Method
- scientific article; zbMATH DE number 1256685 (Why is no real title available?)
- The Algorithmic Aspects of Uncrowded Hypergraphs
- The Algorithmic Aspects of the Regularity Lemma
- An algorithmic hypergraph regularity lemma
- An Algorithmic Hypergraph Regularity Lemma
- On characterizing hypergraph regularity
- Regularity Lemma for k-uniform hypergraphs
- Hypergraph Independent Sets
- Regularity Lemmas and Combinatorial Algorithms
- A fast new algorithm for weak graph regularity
- An extension of the blow-up lemma to arrangeable graphs
- Density and regularity theorems for semi-algebraic hypergraphs
- The hypergraph regularity method and its applications
- Constructive packings by linear hypergraphs
- Partitioning problems in dense hypergraphs
- Some Cubic Time Regularity Algorithms for Triple Systems
- On the Keevash-Knox-Mycroft conjecture
This page was built for publication: An Algorithmic Regularity Lemma for Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4507384)