Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\) (Q965963): 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: Q958734 / rank
Normal rank
 
Property / author
 
Property / author: Q313404 / rank
Normal rank
 
Property / author
 
Property / author: Jordi Moragas / rank
Normal rank
 
Property / author
 
Property / author: Anna S. Lladó / rank
 
Normal rank
Property / author
 
Property / author: Susana-Clara López / rank
 
Normal rank
Property / author
 
Property / author: Jordi Moragas / 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.1016/j.disc.2009.09.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091970724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive Latin transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed graceful labellings of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Graham and Häggkvist with the polynomial method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic survey of graph labeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3480087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti‐magic graphs via the Combinatorial NullStellenSatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\rho\)-valuations for some stunted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinct Sums Modulo <i>n</i> and Tree Embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401957 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-decompositions of<i>K<sub>n,n</sub></i>into isomorphic copies of a given tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589124 / rank
 
Normal rank

Latest revision as of 18:16, 2 July 2024

scientific article
Language Label Description Also known as
English
Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)
scientific article

    Statements

    Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\) (English)
    0 references
    27 April 2010
    0 references
    graph labelings
    0 references
    graph decompositions
    0 references
    combinatorial nullstellensatz
    0 references
    0 references
    0 references
    0 references

    Identifiers