The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs (Q256345): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q122973161, #quickstatements; #temporary_batch_1707216511891
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Maya Jakobine Stein / rank
Normal rank
 
Property / author
 
Property / author: Miklós Simmonovits / rank
Normal rank
 
Property / author
 
Property / author: Maya Jakobine Stein / rank
 
Normal rank
Property / author
 
Property / author: Miklós Simmonovits / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3104378477 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1406.3935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can a Graph Have Distinct Regular Partitions? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Moments of two-variable functions and the uniqueness of graph limits / 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: On the Loebl-Koml�s-S�s conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs / 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: Q4878286 / 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: The History of Degenerate (Bipartite) Extremal Graph Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey numbers for trees of small maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loebl-Komlós-Sós conjecture: dense case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding large subgraphs into dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Seymour conjecture for large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to avoid using the regularity Lemma: Pósa's conjecture revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate version of the Loebl-Komlós-Sós conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Komlós conjecture for graphs of girth 7 / 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: Q4200109 / 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: Proof of the \((n/2 - n/2 - n/2)\) conjecture for large \(n\) / rank
 
Normal rank

Latest revision as of 15:02, 11 July 2024

scientific article
Language Label Description Also known as
English
The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
scientific article

    Statements

    The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 March 2016
    0 references
    extremal graph theory
    0 references
    tree-containment problems
    0 references
    Loebl-Komlós-Sós conjecture
    0 references
    regularity lemma
    0 references
    sparse graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references