Additive approximation of generalized Turán questions

DOI10.1007/s00453-021-00899-4OpenAlexW4205116683MaRDI QIDQ832525

Clara Shikhelman, Noga Alon

Publication date: 25 March 2022

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-021-00899-4

zbMATH Keywords

regularity lemmageneralized Turan problemsgraph approximation algorithmsgraph modifications

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Related Items

Stability version of Dirac's theorem and its applications for generalized Turán problems, Generalized Turán densities in the hypercube

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of DNA physical mapping
• Fixed-parameter tractability of graph modification problems for hereditary properties
• Parameterized complexity of finding subgraphs with hereditary properties.
• Additive approximation for edge-deletion problems
• An Application of Duality to Edge-Deletion Problems
• The complexity of some edge deletion problems
• Edge-Deletion Problems
• Extremal problems on set systems
• A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
• Can a Graph Have Distinct Regular Partitions?
• Paths, Trees, and Flowers
• Regular Partitions of Hypergraphs: Counting Lemmas
• A Short Proof of the Factor Theorem for Finite Graphs
• Complexity classification of some edge modification problems
• Many \(T\) copies in \(H\)-free graphs