Additive approximation of generalized Turán questions

DOI10.1007/S00453-021-00899-4OpenAlexW4205116683MaRDI QIDQ832525FDOQ832525

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)

Cites Work

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

Cited In (3)

• Additive Approximation of Generalized Tur\'an Questions
• Generalized Turán densities in the hypercube
• Stability version of Dirac's theorem and its applications for generalized Turán problems

This page was built for publication: Additive approximation of generalized Turán questions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832525)