The following pages link to Discrepancy of trees (Q4878286):
Displaying 32 items.
- The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs (Q256345) (← links)
- The cycle discrepancy of three-regular graphs (Q659662) (← links)
- Loebl-Komlós-Sós conjecture: dense case (Q895997) (← links)
- Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs (Q1045015) (← links)
- The smallest Ramsey numbers (Q1297442) (← links)
- The minimum size of graphs satisfying cut conditions (Q1701098) (← links)
- Powers of Hamilton cycles of high discrepancy are unavoidable (Q2161210) (← links)
- On the discrepancies of graphs (Q2181999) (← links)
- The chromatic discrepancy of graphs (Q2341751) (← links)
- On the \(L_{2}\)-discrepancy (Q2381825) (← links)
- Discrepancies of spanning trees and Hamilton cycles (Q2668020) (← links)
- Unbalanced spanning subgraphs in edge labeled complete graphs (Q2692172) (← links)
- Loebl-Komlós-Sós conjecture: dense case (Q2851529) (← links)
- Embedding trees in graphs with independence number two (Q4577857) (← links)
- A Note on Color-Bias Hamilton Cycles in Dense Graphs (Q4990398) (← links)
- A discrepancy version of the Hajnal–Szemerédi theorem (Q4993133) (← links)
- Maximum and Minimum Degree Conditions for Embedding Trees (Q5128507) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition (Q5267992) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs (Q5267993) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs (Q5267994) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result (Q5267995) (← links)
- Trees and gaps from a construction scheme (Q5298209) (← links)
- An approximate version of the Loebl-Komlós-Sós conjecture (Q5895546) (← links)
- An approximate version of the Loebl-Komlós-Sós conjecture (Q5900074) (← links)
- Tree embeddings and tree‐star Ramsey numbers (Q6057900) (← links)
- Color‐biased Hamilton cycles in random graphs (Q6074685) (← links)
- Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result (Q6094046) (← links)
- Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result (Q6094048) (← links)
- Strong 2-degenerate graph embeddings (Q6551190) (← links)
- Minimum degree threshold for \(H\)-factors with high discrepancy (Q6614188) (← links)
- An oriented discrepancy version of Dirac's theorem (Q6615758) (← links)
- Embedding trees with maximum and minimum degree conditions (Q6621161) (← links)
