A sufficient degree condition for a graph to contain all trees of size \(k\) (Q546277): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Erd�s-S�s conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic solution for a new class of forbidden r-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3114975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Sós conjecture for spiders / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős‐Sós Conjecture for trees of diameter four / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge disjoint placement of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing a tree with a graph of the same size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3114952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdös-Sós conjecture for graphs of girth 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdös-Sós conjecture for graphs without \(C_ 4\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Sós conjecture for graphs whose complements contain no \(C_4\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Trees in Graphs whose Complement has no <b><i>K</i></b><sub>2,<b><i>s</i></b></sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variation of a conjecture due to Erdös and Sós / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3158579 / rank
 
Normal rank

Latest revision as of 05:51, 4 July 2024

scientific article
Language Label Description Also known as
English
A sufficient degree condition for a graph to contain all trees of size \(k\)
scientific article

    Statements

    A sufficient degree condition for a graph to contain all trees of size \(k\) (English)
    0 references
    0 references
    0 references
    0 references
    24 June 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    Erdős-sós conjecture
    0 references
    0 references