scientific article; zbMATH DE number 881162
From MaRDI portal
Publication:4878286
zbMath0849.05021MaRDI QIDQ4878286
Vera T. Sós, Martin Loebl, Paul Erdős, Zoltan Fueredi
Publication date: 5 November 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items
Powers of Hamilton cycles of high discrepancy are unavoidable, Embedding trees in graphs with independence number two, Discrepancies of spanning trees and Hamilton cycles, On the discrepancies of graphs, Tree embeddings and tree‐star Ramsey numbers, Color‐biased Hamilton cycles in random graphs, Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result, Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result, Loebl-Komlós-Sós conjecture: dense case, The minimum size of graphs satisfying cut conditions, Unbalanced spanning subgraphs in edge labeled complete graphs, Maximum and Minimum Degree Conditions for Embedding Trees, An approximate version of the Loebl-Komlós-Sós conjecture, An approximate version of the Loebl-Komlós-Sós conjecture, A Note on Color-Bias Hamilton Cycles in Dense Graphs, A discrepancy version of the Hajnal–Szemerédi theorem, Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs, The smallest Ramsey numbers, Loebl-Komlós-Sós Conjecture: dense case, The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition, The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs, The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs, The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result, The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
