Name
Abstract | ||
|---|---|---|
In 2007 Matamala proved that if G is a simple graph with maximum degree Delta >= 3 not containing K Delta+1 as a subgraph and s, t are positive integers such that s + t >= Delta, then the vertex set of G admits a partition (S, T) such that G[S] is a maximum order (s - 1)-degenerate subgraph of G and G[T] is a (t - 1)-degenerate subgraph of G. This result extended earlier results obtained by Borodin, by Bollobas and Manvel, by Catlin, by Gerencser and by Catlin and Lai. In this paper we prove a hypergraph version of this result and extend it to variable degeneracy and to partitions into more than two parts, thereby extending a result by Borodin, Kostochka, and Toft. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.5614/ejgta.2021.9.1.1 | ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS |
Keywords | DocType | Volume |
hypergraph decomposition, vertex partition, degeneracy, coloring of hypergraphs | Journal | 9 |
Issue | ISSN | Citations |
1 | 2338-2287 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Schweser | 1 | 0 | 0.34 |
| Michael Stiebitz | 2 | 207 | 30.08 |