Pages that link to "Item:Q1613547"
From MaRDI portal
The following pages link to Tripartite version of the Corrádi-Hajnal theorem (Q1613547):
Displaying 20 items.
- Approximate multipartite version of the Hajnal-Szemerédi theorem (Q412166) (← links)
- Quadripartite version of the Hajnal-Szemerédi theorem (Q941371) (← links)
- A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (Q1024477) (← links)
- Tiling tripartite graphs with 3-colorable graphs: the extreme case (Q1756047) (← links)
- On multipartite Hajnal-Szemerédi theorems (Q1945958) (← links)
- \(K_r\)-factors in graphs with low independence number (Q1998757) (← links)
- Powers of Hamiltonian cycles in multipartite graphs (Q2075502) (← links)
- Cyclic triangle factors in regular tournaments (Q2335694) (← links)
- A multipartite Hajnal-Szemerédi theorem (Q2349514) (← links)
- Asymptotic multipartite version of the Alon-Yuster theorem (Q2407378) (← links)
- On factors of independent transversals in \(k\)-partite graphs (Q2665964) (← links)
- Minimum degree thresholds for bipartite graph tiling (Q2888882) (← links)
- Multipartite Ramsey numbers for odd cycles (Q3633004) (← links)
- An Asymptotic Multipartite Kühn--Osthus Theorem (Q5275440) (← links)
- A geometric theory for hypergraph matching (Q5497101) (← links)
- Transversal <i>C<sub>k</sub></i>-factors in subgraphs of the balanced blow-up of <i>C<sub>k</sub></i> (Q5886351) (← links)
- Embedding clique-factors in graphs with low \(\ell\)-independence number (Q6038592) (← links)
- On sufficient conditions for spanning structures in dense graphs (Q6075109) (← links)
- \(H\)-factors in graphs with small independence number (Q6615761) (← links)
- Spanning trees in graphs without large bipartite holes (Q6632805) (← links)
