scientific article; zbMATH DE number 881162

MaRDI QIDQ4878286zbMATH OpenFDO

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

Publication date 5 November 1996

zbMATH Keywords

discrepancyedge coloringextremal graphsRamsey theorytree

Mathematics Subject Classification ID

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

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

Cited in

(40)

• Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
• The smallest Ramsey numbers
• The minimum size of graphs satisfying cut conditions
• Powers of Hamilton cycles of high discrepancy are unavoidable
• On the discrepancies of graphs
• The chromatic discrepancy of graphs
• On the \(L_{2}\)-discrepancy
• The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
• Discrepancies of spanning trees and Hamilton cycles
• Unbalanced spanning subgraphs in edge labeled complete graphs
• Loebl-Komlós-Sós conjecture: dense case
• Embedding trees in graphs with independence number two
• scientific article; zbMATH DE number 881159 (Why is no real title available?)
• A note on color-bias Hamilton cycles in dense graphs
• A discrepancy version of the Hajnal-Szemerédi theorem
• Maximum and minimum degree conditions for embedding trees
• 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
• Trees and gaps from a construction scheme
• Discrepancy in graphs and hypergraphs
• An approximate version of the Loebl-Komlós-Sós conjecture
• An approximate version of the Loebl-Komlós-Sós conjecture
• 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
• Strong 2-degenerate graph embeddings
• The cycle discrepancy of three-regular graphs
• Minimum degree threshold for \(H\)-factors with high discrepancy
• An oriented discrepancy version of Dirac's theorem
• Embedding trees with maximum and minimum degree conditions
• Tight Hamilton cycles with high discrepancy
• Steiner triple systems with high discrepancy
• Discrepancies of subtrees
• A potential degree sequence problem of the Loebl-Komlós-Sós conjecture
• Graph theory. Abstracts from the workshop held January 5--10, 2025
• The Turán number of spanning star forests
• Loebl-Komlós-Sós conjecture: dense case

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)