Additive approximation of generalized Turán questions (Q832525): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Noga Alon / rank
Normal rank
 
Property / author
 
Property / author: Noga Alon / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-021-00899-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4205116683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive approximation for edge-deletion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can a Graph Have Distinct Regular Partitions? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many \(T\) copies in \(H\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Duality to Edge-Deletion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of some edge deletion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems on set systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of DNA physical mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of finding subgraphs with hereditary properties. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity classification of some edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Partitions of Hypergraphs: Counting Lemmas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short Proof of the Factor Theorem for Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Deletion Problems / rank
 
Normal rank

Latest revision as of 10:57, 28 July 2024

scientific article
Language Label Description Also known as
English
Additive approximation of generalized Turán questions
scientific article

    Statements

    Additive approximation of generalized Turán questions (English)
    0 references
    0 references
    0 references
    0 references
    25 March 2022
    0 references
    graph approximation algorithms
    0 references
    generalized Turan problems
    0 references
    graph modifications
    0 references
    regularity lemma
    0 references

    Identifiers