Name
Abstract | ||
|---|---|---|
Let G be a quadripartite graph with N vertices in each vertex class and each vertex is adjacent to at least (34)N vertices in each of the other classes. There exists an N\"0 such that, if N=N\"0, then G contains a subgraph that consists of N vertex-disjoint copies of K\"4. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.disc.2007.08.019 | Discrete Mathematics |
Keywords | Field | DocType |
graph packing,hajnal–szemerédi,regularity lemma,hajnal-szemerédi | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Existential quantification,Vertex (graph theory),Graph packing,Neighbourhood (graph theory),Mathematics | Journal |
Volume | Issue | ISSN |
308 | 19 | Discrete Mathematics |
Citations | PageRank | References |
9 | 0.59 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ryan Martin | 1 | 144 | 14.43 |
| Endre Szemerédi | 2 | 2102 | 363.27 |