The following pages link to \(H\)-factors in dense graphs (Q1924126):
Displaying 50 items.
- A degree sequence Hajnal-Szemerédi theorem (Q256981) (← links)
- Perfect packings in quasirandom hypergraphs. I. (Q273176) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- On the KŁR conjecture in random graphs (Q476516) (← links)
- Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs (Q516075) (← links)
- A refinement of a result of Corrádi and Hajnal (Q520047) (← links)
- Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture (Q555496) (← links)
- A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs (Q697080) (← links)
- Vertex-disjoint quadrilaterals in graphs (Q704291) (← links)
- Bandwidth theorem for random graphs (Q765187) (← links)
- Packing \(k\)-partite \(k\)-uniform hypergraphs (Q891826) (← links)
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs (Q933679) (← links)
- On embedding well-separable graphs (Q941369) (← links)
- Proof of the bandwidth conjecture of Bollobás and Komlós (Q957895) (← links)
- Ore-type versions of Brooks' theorem (Q1003831) (← links)
- Triangle packings and 1-factors in oriented graphs (Q1026012) (← links)
- On 2-factors with cycles containing specified vertices in a bipartite graph (Q1034963) (← links)
- Vertex-disjoint claws in graphs (Q1292832) (← links)
- Cycle factors in dense graphs (Q1292839) (← links)
- On quadrilaterals in a graph (Q1301667) (← links)
- Optimal factorizations of families of trees (Q1301677) (← links)
- Vertex-disjoint cycles of the same length. (Q1405099) (← links)
- On a tiling conjecture of Komlós for 3-chromatic graphs. (Q1426117) (← links)
- Sharpening an ore-type version of the Corrádi-Hajnal theorem (Q1688267) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- Covering a graph with cycles of length at least 4 (Q1753038) (← links)
- Tiling tripartite graphs with 3-colorable graphs: the extreme case (Q1756047) (← links)
- Star-factors in graphs with large minimum degree (Q1791704) (← links)
- Almost-spanning subgraphs with bounded degree in dense graphs (Q1864574) (← links)
- 2-factors in dense graphs (Q1917480) (← links)
- On multipartite Hajnal-Szemerédi theorems (Q1945958) (← links)
- Tilings in vertex ordered graphs (Q2131863) (← links)
- The minimum degree threshold for perfect graph packings (Q2149489) (← links)
- Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles (Q2195224) (← links)
- A degree sequence version of the Kühn-Osthus tiling theorem (Q2195226) (← links)
- On vertex-induced weighted Turán problems (Q2237208) (← links)
- The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
- Minimum \(H\)-decompositions of graphs (Q2384810) (← links)
- Asymptotic multipartite version of the Alon-Yuster theorem (Q2407378) (← links)
- Minimum degree conditions for vertex-disjoint even cycles in large graphs (Q2439893) (← links)
- Perfect packings with complete graphs minus an edge (Q2461771) (← links)
- An Ore-type theorem on equitable coloring (Q2464162) (← links)
- Vertex disjoint copies of \(K_{1 , 4}\) in claw-free graphs (Q2662607) (← links)
- A greedy algorithm for the social golfer and the Oberwolfach problem (Q2670589) (← links)
- (Q2857424) (← links)
- Corrádi and Hajnal's Theorem for Sparse Random Graphs (Q2883851) (← links)
- Minimum degree thresholds for bipartite graph tiling (Q2888882) (← links)
- Triangle factors of graphs without large independent sets and of weighted graphs (Q2953695) (← links)
- The Complexity of Perfect Packings in Dense Graphs (Q2988829) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
