Quadripartite version of the Hajnal-Szemerédi theorem

Ryan Martin, E. Szemerédi

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

Let G be a quadripartite graph with N vertices in each vertex class and each vertex is adjacent to at least (frac(3, 4)) N vertices in each of the other classes. There exists an N0 such that, if N ≥ N0, then G contains a subgraph that consists of N vertex-disjoint copies of K4.

Original languageEnglish
Pages (from-to)4337-4360
Number of pages24
JournalDiscrete Mathematics
Volume308
Issue number19
DOIs
Publication statusPublished - Oct 6 2008

Fingerprint

Vertex of a graph
Theorem
Subgraph
Disjoint
Adjacent
Graph in graph theory
Class

Keywords

  • Graph packing
  • Hajnal-Szemerédi
  • Regularity lemma

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Quadripartite version of the Hajnal-Szemerédi theorem. / Martin, Ryan; Szemerédi, E.

In: Discrete Mathematics, Vol. 308, No. 19, 06.10.2008, p. 4337-4360.

Research output: Contribution to journalArticle

Martin, Ryan ; Szemerédi, E. / Quadripartite version of the Hajnal-Szemerédi theorem. In: Discrete Mathematics. 2008 ; Vol. 308, No. 19. pp. 4337-4360.
@article{73b7840d01dd45dd860a647bacccb9a0,
title = "Quadripartite version of the Hajnal-Szemer{\'e}di theorem",
abstract = "Let G be a quadripartite graph with N vertices in each vertex class and each vertex is adjacent to at least (frac(3, 4)) N vertices in each of the other classes. There exists an N0 such that, if N ≥ N0, then G contains a subgraph that consists of N vertex-disjoint copies of K4.",
keywords = "Graph packing, Hajnal-Szemer{\'e}di, Regularity lemma",
author = "Ryan Martin and E. Szemer{\'e}di",
year = "2008",
month = "10",
day = "6",
doi = "10.1016/j.disc.2007.08.019",
language = "English",
volume = "308",
pages = "4337--4360",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "19",

}

TY - JOUR

T1 - Quadripartite version of the Hajnal-Szemerédi theorem

AU - Martin, Ryan

AU - Szemerédi, E.

PY - 2008/10/6

Y1 - 2008/10/6

N2 - Let G be a quadripartite graph with N vertices in each vertex class and each vertex is adjacent to at least (frac(3, 4)) N vertices in each of the other classes. There exists an N0 such that, if N ≥ N0, then G contains a subgraph that consists of N vertex-disjoint copies of K4.

AB - Let G be a quadripartite graph with N vertices in each vertex class and each vertex is adjacent to at least (frac(3, 4)) N vertices in each of the other classes. There exists an N0 such that, if N ≥ N0, then G contains a subgraph that consists of N vertex-disjoint copies of K4.

KW - Graph packing

KW - Hajnal-Szemerédi

KW - Regularity lemma

UR - http://www.scopus.com/inward/record.url?scp=45249101780&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=45249101780&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2007.08.019

DO - 10.1016/j.disc.2007.08.019

M3 - Article

AN - SCOPUS:45249101780

VL - 308

SP - 4337

EP - 4360

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 19

ER -