Degree Conditions for Embedding Trees (Q5232383): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q127315100, #quickstatements; #temporary_batch_1722791855867
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Maya Jakobine Stein / rank
Normal rank
 
Property / author
 
Property / author: Maya Jakobine Stein / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1805.07338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum and Minimum Degree Conditions for Embedding Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Erdős–Sós conjecture for trees with bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / 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: Q3060859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5543308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radius, diameter, and minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Erdős-Sós conjecture for trees of large size / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of the Erdős‐Sós conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a Packing Conjecture of Bollobás / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees in Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2971194821 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127315100 / rank
 
Normal rank

Latest revision as of 18:24, 4 August 2024

scientific article; zbMATH DE number 7100521
Language Label Description Also known as
English
Degree Conditions for Embedding Trees
scientific article; zbMATH DE number 7100521

    Statements

    Degree Conditions for Embedding Trees (English)
    0 references
    0 references
    0 references
    0 references
    2 September 2019
    0 references
    extremal graph theory
    0 references
    tree embedding
    0 references
    degree
    0 references
    minimum degree
    0 references
    maximum degree
    0 references
    subgraph
    0 references

    Identifiers