Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2604.25206 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913067558764544 |
|---|---|
| author | Feng, Tao Liu, Hengrui Yu, Shikang |
| author_facet | Feng, Tao Liu, Hengrui Yu, Shikang |
| contents | This paper concerns fractional $K_s$-decompositions of multipartite graphs. For integers $r\ge s\ge 3$, we consider balanced $r$-partite graphs $G$ on $rn$ vertices. We establish necessary conditions for $G$ to admit a fractional $K_s$-decomposition, extending the notion of $s$-admissibility from the case $r=s$ to $r>s$. Using an association scheme on the edge set of a complete $r$-partite graph, we prove that if $r\ge s+2$ and the partite minimum degree of $G$ is at least $(1-c)n$ with $c\le 1/((s-2)(s+1)(s-1)^4)$, then $G$ has a fractional $K_s$-decomposition. For $r=s+1$, we show that under the condition $c\le 1/(3s^3(s-2)^2)$, every $s$-admissible balanced $(s+1)$-partite graph with partite minimum degree at least $(1-c)n$ admits a fractional $K_s$-decomposition. These results provide new degree thresholds for fractional $K_s$-decompositions of multipartite graphs with more than $s$ parts. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_25206 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Fractional clique decompositions of dense balanced multipartite graphs Feng, Tao Liu, Hengrui Yu, Shikang Combinatorics This paper concerns fractional $K_s$-decompositions of multipartite graphs. For integers $r\ge s\ge 3$, we consider balanced $r$-partite graphs $G$ on $rn$ vertices. We establish necessary conditions for $G$ to admit a fractional $K_s$-decomposition, extending the notion of $s$-admissibility from the case $r=s$ to $r>s$. Using an association scheme on the edge set of a complete $r$-partite graph, we prove that if $r\ge s+2$ and the partite minimum degree of $G$ is at least $(1-c)n$ with $c\le 1/((s-2)(s+1)(s-1)^4)$, then $G$ has a fractional $K_s$-decomposition. For $r=s+1$, we show that under the condition $c\le 1/(3s^3(s-2)^2)$, every $s$-admissible balanced $(s+1)$-partite graph with partite minimum degree at least $(1-c)n$ admits a fractional $K_s$-decomposition. These results provide new degree thresholds for fractional $K_s$-decompositions of multipartite graphs with more than $s$ parts. |
| title | Fractional clique decompositions of dense balanced multipartite graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2604.25206 |