Pages that link to "Item:Q965963"

The following pages link to Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\) (Q965963):

Displaying 8 items.

• Approximate results for rainbow labelings (Q524169) (← links)
• A proof of Ringel's conjecture (Q2232153) (← links)
• Almost every tree with \(n\) edges decomposes \(K_{2n,2n}\) (Q2857407) (← links)
• On a Häggkvist's Conjecture with the Polynomial Method (Q3503519) (← links)
• Almost Every Tree With <i>m</i> Edges Decomposes <i>K</i>_{2<i>m</i>,2<i>m</i>} (Q5414145) (← links)
• Decomposing almost complete graphs by random trees (Q5890651) (← links)
• Decomposing almost complete graphs by random trees (Q5915750) (← links)
• Gregarious \(Y_5\)-tree decompositions of tensor product of complete graphs (Q6558937) (← links)