Additive approximation of generalized Turán questions
From MaRDI portal
(Redirected from Publication:832525)
Recommendations
- Additive approximation for edge-deletion problems
- Some exact results for generalized Turán problems
- Generalized Turán problems for disjoint copies of graphs
- Counting copies of a fixed subgraph in \(F\)-free graphs
- A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- scientific article; zbMATH DE number 2086426 (Why is no real title available?)
- A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
- A Short Proof of the Factor Theorem for Finite Graphs
- Additive approximation for edge-deletion problems
- An Application of Duality to Edge-Deletion Problems
- Can a graph have distinct regular partitions?
- Complexity classification of some edge modification problems
- Edge-Deletion Problems
- Extremal problems on set systems
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Many \(T\) copies in \(H\)-free graphs
- On the complexity of DNA physical mapping
- Parameterized complexity of finding subgraphs with hereditary properties.
- Paths, Trees, and Flowers
- Regular Partitions of Hypergraphs: Counting Lemmas
- The complexity of some edge deletion problems
Cited in
(4)
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)
