The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition (Q5267992): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3101600257 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1408.3858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Algorithmic Aspects of the Regularity Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new rounding procedure for the assignment problem with applications to dense graph arrangement problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest path in a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding nearly-spanning bounded degree trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán numbers of bipartite graphs plus an odd cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Graphs for Bounded-Degree Trees and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large bounded degree trees in expanding graphs / 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: Q3344024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every graph with a positive Cheeger constant contains a tree with a positive Cheeger constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3060859 / 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: Q5315023 / 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: Q3887496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality of random graphs and rainbow embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expanding graphs contain all small trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5659565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size-Ramsey number of trees / 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: Sharp threshold for the appearance of certain spanning trees in random graphs / 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: The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expanders Are Universal for the Class of All Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate version of Sumner's universal tournament conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Sumner's universal tournament conjecture for large tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding large subgraphs into dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Szemerédi’s Regularity Lemma for Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Spanning Trees in Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit distribution for the existence of Hamiltonian cycles in a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees in Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuits in random graphs / 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: Szemerédi's Regularity Lemma for Matrices and Sparse Graphs / 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: Q5294940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized embedding algorithm for trees / 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 00:01, 14 July 2024

scientific article; zbMATH DE number 6730732
Language Label Description Also known as
English
The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition
scientific article; zbMATH DE number 6730732

    Statements

    The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 June 2017
    0 references
    extremal graph theory
    0 references
    Loebl-Komlós-Sós conjecture
    0 references
    tree embedding
    0 references
    regularity lemma
    0 references
    sparse graph
    0 references
    graph decomposition
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers