Packing large trees of consecutive orders (Q2374181): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1510.07467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turán number of sparse spanning graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Tree Packing Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing trees in complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate version of the tree packing conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal result for subgraphs with few edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4860774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4340018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4186364 / rank
 
Normal rank

Latest revision as of 03:51, 13 July 2024

scientific article
Language Label Description Also known as
English
Packing large trees of consecutive orders
scientific article

    Statements

    Packing large trees of consecutive orders (English)
    0 references
    0 references
    14 December 2016
    0 references
    trees
    0 references
    packing of graphs
    0 references
    tree packing conjecture
    0 references

    Identifiers