The Algorithmic Aspects of the Regularity Lemma
From MaRDI portal
Publication:4289842
Recommendations
Cited in
(only showing first 100 items - show all)- A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
- Lepp-bisection algorithms, applications and mathematical properties
- Highly connected coloured subgraphs via the regularity Lemma
- Short paths in \(\varepsilon \)-regular pairs and small diameter decompositions of dense graphs
- A simple algorithm for constructing Szemerédi's regularity partition
- Cycle factors in dense graphs
- Hypergraphs, quasi-randomness, and conditions for regularity
- Weak internal partition of regular graphs
- Graph summarization with quality guarantees
- Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs
- Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem
- Embedding graphs with bounded degree in sparse pseudorandom graphs
- Bounds for graph regularity and removal lemmas
- Regularity lemmas for clustering graphs
- Induced arithmetic removal: complexity 1 patterns over finite fields
- On the local structure of oriented graphs -- a case study in flag algebras
- The edit distance function of some graphs
- Efficient removal lemmas for matrices
- The maximum spectral radius of graphs without friendship subgraphs
- Regular partitions of gentle graphs
- Minimum \(H\)-decompositions of graphs
- Additive approximation for edge-deletion problems
- Hamilton decompositions of regular expanders: applications
- Extremal results in sparse pseudorandom graphs
- Threshold behavior of multi-path random key pre-distribution for sparse wireless sensor networks
- Almost given length cycles in digraphs
- Large planar subgraphs in dense graphs
- Spectral extremal graphs for disjoint cliques
- Grothendieck-type inequalities in combinatorial optimization
- Regularity lemmas and combinatorial algorithms
- A deterministic algorithm for the Frieze-Kannan regularity lemma
- Weak quasi-randomness for uniform hypergraphs
- Testing Odd-Cycle-Freeness in Boolean Functions
- Path and cycle decompositions of dense graphs
- Every Monotone 3-Graph Property is Testable
- A Folkman linear family
- Can a Graph Have Distinct Regular Partitions?
- The correctness of algebraic closures of finite degree of a family of estimate-computing algorithms for regular problems
- scientific article; zbMATH DE number 1256685 (Why is no real title available?)
- An algorithmic version of the blow-up lemma
- Random graphs with monochromatic triangles in every edge coloring
- Regular pairs in sparse random graphs I
- An Algorithmic Regularity Lemma for Hypergraphs
- scientific article; zbMATH DE number 1512671 (Why is no real title available?)
- New applications of the polynomial method: the cap set conjecture and beyond
- An Algorithmic Hypergraph Regularity Lemma
- Combinatorial and computational aspects of graph packing and graph decomposition
- Constructive Packings of Triple Systems
- Hamilton cycles in dense vertex-transitive graphs
- A blow-up lemma for approximate decompositions
- On the KŁR conjecture in random graphs
- On characterizing hypergraph regularity
- scientific article; zbMATH DE number 2119673 (Why is no real title available?)
- Hardness and algorithms for rainbow connection
- Estimating parameters associated with monotone properties
- Efficient removal lemmas for matrices
- NOTES ON THE STABLE REGULARITY LEMMA
- The bipartite QUBO
- On the interplay between strong regularity and graph densification
- Testing Linear-Invariant Properties
- Amplification and Derandomization without Slowdown
- Regularity Lemmas and Combinatorial Algorithms
- Can a graph have distinct regular partitions?
- On random sampling in uniform hypergraphs
- A fast new algorithm for weak graph regularity
- The induced removal lemma in sparse graphs
- The approximate Loebl-Komlós-Sós conjecture. I: The sparse decomposition
- The approximate Loebl-Komlós-Sós conjecture IV: Embedding techniques and the proof of the main result
- Separating hash families: a Johnson-type bound and new constructions
- An optimal algorithm for finding Frieze-Kannan regular partitions
- Easily testable graph properties
- On regularity lemmas and their algorithmic applications
- Approximate hypergraph partitioning and applications
- Constructive packings by linear hypergraphs
- Regularity lemmas for stable graphs
- Testing odd-cycle-freeness in Boolean functions
- An algorithmic proof of Brégman–Minc theorem
- Testing subgraphs in directed graphs
- Maximum dispersion problem in dense graphs
- Partitioning problems in dense hypergraphs
- Making an H H‐free graph k k‐colorable
- Minimum degree and the graph removal lemma
- A further extension of Rödl's theorem
- Some Cubic Time Regularity Algorithms for Triple Systems
- Local-vs-global combinatorics
- An approximate version of Sumner's universal tournament conjecture
- Regular decomposition of the edge set of a graph with applications
- Model theory and agnostic online learning via excellent sets
- Abundance: asymmetric graph removal lemmas and integer solutions to linear equations
- Is it easy to regularize a hypergraph with easy links?
- Exact algorithms for the maximum k-balanced weighted biclique problem
- On the maximum number of r-cliques in graphs free of complete r-partite subgraphs
- Turán colourings in off-diagonal Ramsey multiplicity
- Efficient polynomial-time approximation scheme for the genus of dense graphs
- Spectral extremal graphs for disjoint odd wheels
- Finding maximum edge bicliques in tree convex graphs
- Results on H-freeness testing in graphs of bounded r-admissibility
- Asymmetric results about graph homomorphisms
- A fast coloring oracle for average case hypergraphs
- A new integer linear programming formulation for the maximum balanced bi-clique problem
This page was built for publication: The Algorithmic Aspects of the Regularity Lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4289842)
