A multipartite Hajnal–Szemerédi theorem

Keevash, Peter; Mycroft, Richard

doi:10.1016/j.jctb.2015.04.003

Record: found
Abstract: found
Article: found

Is Open Access

A multipartite Hajnal–Szemerédi theorem

Author(s): Peter Keevash, Richard Mycroft

Publication date: 2015-09-01

Journal: Journal of Combinatorial Theory, Series A

Publisher: Elsevier BV

Read this article at

ScienceOpen Publisher

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 5

Record: found
Abstract: not found
Article: not found

On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I

S. Hakimi (1962)

0 comments Cited 91 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

Variants of the Hajnal-Szemer�di Theorem

Eldar Fischer (1999)

0 comments Cited 9 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs

Allan Lo, KLAS MARKSTRÖM (2013)

0 comments Cited 7 times – based on 0 reviews      Review now

Bookmark

All references

Author and article information

Journal

DOI:: 10.1016/j.jctb.2015.04.003

License:

https://www.elsevier.com/tdm/userlicense/1.0/

Data availability:

A multipartite Hajnal–Szemerédi theorem

Read this article at

Related collections

ScienceOpen Research

Most cited references 5

On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I

Variants of the Hajnal-Szemer�di Theorem

A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs

Author and article information

Journal

Comments

Comment on this article

Similar content 701

Cited by 3

Most referenced authors 17