scientific article; zbMATH DE number 881162

zbMATH Open0849.05021MaRDI QIDQ4878286FDOQ4878286

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

Publication date: 5 November 1996

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

Recommendations

• scientific article; zbMATH DE number 881159
• Discrepancies of spanning trees and Hamilton cycles
• Discrepancy in graphs and hypergraphs
• On small \(n\)-uniform hypergraphs with positive discrepancy

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 (33)

• Maximum and minimum degree conditions for embedding trees
• 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
• 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
• 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
• A note on color-bias Hamilton cycles in dense graphs
• A discrepancy version of the Hajnal-Szemerédi theorem
• Embedding trees with maximum and minimum degree conditions
• On the \(L_{2}\)-discrepancy
• An approximate version of the Loebl-Komlós-Sós conjecture
• The chromatic discrepancy of graphs
• Powers of Hamilton cycles of high discrepancy are unavoidable
• On the discrepancies of graphs
• 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
• Discrepancy in graphs and hypergraphs
• Unbalanced spanning subgraphs in edge labeled complete graphs
• Embedding trees in graphs with independence number two
• The cycle discrepancy of three-regular graphs
• 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)