An approximate version of the tree packing conjecture (Q273108): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q123122217 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1404.0697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3503433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing tree factors in random and pseudo-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Tree Packing Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on quasirandom graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The triangle-free process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on packing trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packings of graphs and applications to computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on packing trees into complete bipartite graphs and on Fishburn's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing graphs: The packing problem solved / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs of graphs. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Trees into the Complete Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced integer arrays: a matrix packing theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing trees in complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3496342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration for self-bounding functions and an inequality of Talagrand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing minor closed families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a packing and covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On packing trees into complete bipartite graphs / rank
 
Normal rank

Latest revision as of 20:44, 11 July 2024

scientific article
Language Label Description Also known as
English
An approximate version of the tree packing conjecture
scientific article

    Statements

    An approximate version of the tree packing conjecture (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 April 2016
    0 references
    random tree embedding process
    0 references
    nibble method
    0 references

    Identifiers