Name
Abstract | ||
|---|---|---|
Given positive integers a≤b≤c, let Ka,b,c be the complete 3-partite 3-uniform hypergraph with three parts of sizes a,b,c. Let H be a 3-uniform hypergraph on n vertices where n is divisible by a+b+c. We asymptotically determine the minimum vertex degree of H that guarantees a perfect Ka,b,c-tiling, that is, a spanning subgraph of H consisting of vertex-disjoint copies of Ka,b,c. This partially answers a question of Mycroft, who proved an analogous result with respect to codegree for r-uniform hypergraphs for all r≥3. Our proof uses a lattice-based absorbing method, the concept of fractional tiling, and a recent result on shadows for 3-graphs. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.jcta.2017.02.003 | Journal of Combinatorial Theory, Series A |
Keywords | Field | DocType |
Graph packing,Hypergraph,Absorbing method,Regularity lemma | Integer,Graph,Discrete mathematics,Combinatorics,Spanning subgraph,Vertex (geometry),Lattice (order),Constraint graph,Hypergraph,Degree (graph theory),Mathematics | Journal |
Volume | ISSN | Citations |
149 | 0097-3165 | 4 |
PageRank | References | Authors |
0.49 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jie Han | 1 | 31 | 8.16 |
| chuanyun zang | 2 | 4 | 0.49 |
| Yi Zhao | 3 | 40 | 6.92 |