Variants of the Hajnal-Szemer�di Theorem

DOI<275::AID-JGT2>3.0.CO;2-F 10.1002/(SICI)1097-0118(199908)31:4<275::AID-JGT2>3.0.CO;2-FzbMath0937.05068OpenAlexW4236979380MaRDI QIDQ4261183

Eldar Fischer

Publication date: 4 June 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199908)31:4<275::aid-jgt2>3.0.co;2-f

zbMATH Keywords

minimum degreeregular factor

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

An Asymptotic Multipartite Kühn--Osthus Theorem, Transversal C_k-factors in subgraphs of the balanced blow-up of C_k, Minimum degree thresholds for bipartite graph tiling, Asymptotic multipartite version of the Alon-Yuster theorem, On factors of independent transversals in \(k\)-partite graphs, Rainbow spanning structures in graph and hypergraph systems, Triangle factors of graphs without large independent sets and of weighted graphs, On sufficient conditions for spanning structures in dense graphs, Approximate multipartite version of the Hajnal-Szemerédi theorem, On multipartite Hajnal-Szemerédi theorems, Completion and deficiency problems, On Directed Versions of the Hajnal–Szemerédi Theorem, Quadripartite version of the Hajnal-Szemerédi theorem, Tiling tripartite graphs with 3-colorable graphs: the extreme case, A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs, Triangle‐factors in pseudorandom graphs, Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree, Powers of Hamiltonian cycles in multipartite graphs, A geometric theory for hypergraph matching, Cycle factors in dense graphs, A multipartite Hajnal-Szemerédi theorem

Cites Work

• Cycle factors in dense graphs