The following pages link to Diana Piguet (Q256342):
Displaying 23 items.
- The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs (Q256345) (← links)
- An approximate version of the tree packing conjecture (Q273108) (← links)
- An extension of Turán's theorem, uniqueness and stability (Q463041) (← links)
- Embedding cycles of given length in oriented graphs (Q691601) (← links)
- Loebl-Komlós-Sós conjecture: dense case (Q895997) (← links)
- The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars (Q1010834) (← links)
- First steps in combinatorial optimization on graphons: matchings (Q1689941) (← links)
- A skew version of the Loebl-Komlós-Sós conjecture (Q1690002) (← links)
- A version of the Loebl-Komlós-Sós conjecture for skew trees (Q2189826) (← links)
- Tilings in graphons (Q2225467) (← links)
- Loebl-Komlós-Sós conjecture: dense case (Q2851529) (← links)
- A density Corrádi-Hajnal theorem (Q2857315) (← links)
- An Approximate Version of the Tree Packing Conjecture via Random Embeddings (Q2969640) (← 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)
- Komlós's tiling theorem via graphon covers (Q5379813) (← links)
- The tripartite Ramsey number for trees (Q5891229) (← 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)
- A median-type condition for graph tiling (Q5915833) (← links)
- The approximate Loebl-Koml\'os-S\'os Conjecture (Q6237128) (← links)
