Pages that link to "Item:Q4903264"
From MaRDI portal
The following pages link to A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs (Q4903264):
Displaying 19 items.
- Tiling tripartite graphs with 3-colorable graphs: the extreme case (Q1756047) (← links)
- Powers of Hamiltonian cycles in multipartite graphs (Q2075502) (← links)
- Completion and deficiency problems (Q2200922) (← links)
- Cyclic triangle factors in regular tournaments (Q2335694) (← links)
- \(F\)-factors in hypergraphs via absorption (Q2345534) (← links)
- A multipartite Hajnal-Szemerédi theorem (Q2349514) (← links)
- Clique decompositions of multipartite graphs and completion of Latin squares (Q2363362) (← links)
- Asymptotic multipartite version of the Alon-Yuster theorem (Q2407378) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Triangle‐factors in pseudorandom graphs (Q4968390) (← links)
- An asymptotic bound for the strong chromatic number (Q5222554) (← links)
- An Asymptotic Multipartite Kühn--Osthus Theorem (Q5275440) (← links)
- A geometric theory for hypergraph matching (Q5497101) (← links)
- Transversal factors and spanning trees (Q5871277) (← 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)
- Rainbow spanning structures in graph and hypergraph systems (Q6052079) (← links)
- On sufficient conditions for spanning structures in dense graphs (Q6075109) (← links)
- Spanning trees in graphs without large bipartite holes (Q6632805) (← links)
- Sufficient conditions for perfect mixed tilings (Q6652093) (← links)
