An improved error term for minimum \(H\)-decompositions of graphs (Q740649): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jctb.2014.03.001 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On complete subgraphs of different orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Representation of a Graph by Set Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supersaturated graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of K. Zarankiewicz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum \(H\)-decompositions of graphs: edge-critical case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum \(H\)-decompositions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions of graphs into 5-cycles and other small graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3166469 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCTB.2014.03.001 / rank
 
Normal rank

Latest revision as of 03:39, 10 December 2024

scientific article
Language Label Description Also known as
English
An improved error term for minimum \(H\)-decompositions of graphs
scientific article

    Statements

    An improved error term for minimum \(H\)-decompositions of graphs (English)
    0 references
    0 references
    4 September 2014
    0 references
    graph decomposition
    0 references
    stability method
    0 references
    Turán number
    0 references
    Turán graph
    0 references

    Identifiers