scientific article; zbMATH DE number 881162

zbMATH Open0849.05021MaRDI QIDQ4878286FDOQ4878286

Vera T. Sós, P. Erdős, Zoltán Füredi, Martin Loebl

Publication date: 5 November 1996

Title of this publication is not available (Why is that?)

zbMATH Keywords

treediscrepancyRamsey theoryextremal graphsedge coloring

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cited In (29)

• 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
• A Note on Color-Bias Hamilton Cycles in Dense Graphs
• A discrepancy version of the Hajnal–Szemerédi theorem
• An approximate version of the Loebl-Komlós-Sós conjecture
• Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result
• Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
• The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
• Loebl-Komlós-Sós conjecture: dense case
• Tree embeddings and tree‐star Ramsey numbers
• The smallest Ramsey numbers
• An oriented discrepancy version of Dirac's theorem
• Minimum degree threshold for \(H\)-factors with high discrepancy
• Embedding trees with maximum and minimum degree conditions
• An approximate version of the Loebl-Komlós-Sós conjecture
• Powers of Hamilton cycles of high discrepancy are unavoidable
• On the discrepancies of graphs
• Maximum and Minimum Degree Conditions for Embedding Trees
• Loebl-Komlós-Sós conjecture: dense case
• Discrepancies of spanning trees and Hamilton cycles
• Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result
• Color‐biased Hamilton cycles in random graphs
• Unbalanced spanning subgraphs in edge labeled complete graphs
• Embedding trees in graphs with independence number two
• Trees and gaps from a construction scheme
• The minimum size of graphs satisfying cut conditions
• Strong 2-degenerate graph embeddings

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4878286)