Skip to main content Accessibility help
×
Home

Fractional Clique Decompositions of Dense Partite Graphs

  • RICHARD MONTGOMERY (a1)

Abstract

We give a minimum degree condition sufficient to ensure the existence of a fractional Kr -decomposition in a balanced r-partite graph (subject to some further simple necessary conditions). This generalizes the non-partite problem studied recently by Barber, Lo, Kühn, Osthus and the author, and the 3-partite fractional K 3-decomposition problem studied recently by Bowditch and Dukes. Combining our result with recent work by Barber, Kühn, Lo, Osthus and Taylor, this gives a minimum degree condition sufficient to ensure the existence of a (non-fractional) Kr -decomposition in a balanced r-partite graph (subject to the same simple necessary conditions).

Copyright

References

Hide All
[1] Barber, B., Kühn, D., Lo, A. and Osthus, D. (2016) Edge-decompositions of graphs with high minimum degree. Adv. Math. 288 337385.
[2] Barber, B., Kühn, D., Lo, A., Montgomery, R. and Osthus, D. (2017) Fractional clique decompositions of dense graphs and hypergraphs. J. Combinatorial Theory Series B, to appear.
[3] Barber, B., Kühn, D., Lo, A., Osthus, D. and Taylor, A. (2017) Clique decompositions of multipartite graphs and completion of Latin squares. J. Combinatorial Theory Series A 151 146201.
[4] Bowditch, F. and Dukes, P. (2015) Fractional triangle decompositions of dense 3-partite graphs. arXiv:1510.08998
[5] Dross, F. (2016) Fractional triangle decompositions in graphs with large minimum degree. SIAM J. Discrete Math. 30 3642.
[6] Dukes, P. (2012) Rational decomposition of dense hypergraphs and some related eigenvalue estimates. Linear Algebra Appl. 436 37363746.
[7] Dukes, P. (2015) Corrigendum to ‘Rational decomposition of dense hypergraphs and some related eigenvalue estimates (Linear Algebra Appl. 436 (2012) 3736–3746)’. Linear Algebra Appl. 467 267269.
[8] Garaschuk, K. (2014) Linear methods for rational triangle decompositions. PhD thesis, University of Victoria.
[9] Haxell, P. and Rödl, V. (2001) Integer and fractional packings in dense graphs. Combinatorica 21 1338.
[10] Keevash, P. (2014) The existence of designs. arXiv:1401.3665
[11] Kirkman, T. (1847) On a problem in combinations. The Cambridge and Dublin Mathematical Journal II 191204.
[12] Wilson, R. (1975) Decomposition of complete graphs into subgraphs isomorphic to a given graph. Congress. Numer. XV 647659.
[13] Yuster, R. (2005) Asymptotically optimal Kk -packings of dense graphs via fractional Kk -decompositions. J. Combin. Theory Ser. B 95 111.

MSC classification

Related content

Powered by UNSILO

Fractional Clique Decompositions of Dense Partite Graphs

  • RICHARD MONTGOMERY (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.