Fractional clique decompositions of dense graphs

DOI10.1002/RSA.20809MaRDI QIDQ5229342zbMATH OpenOpenAlexWikidataFDO

Authors Richard Montgomery

Publication date 14 August 2019

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1711.03382, https://research.birmingham.ac.uk/portal/en/publications/fractional-clique-decompositions-of-dense-graphs(3ed84e1d-086a-49d3-8ad7-e592531a9e4b).html

zbMATH Keywords

clique decompositionsfractional graph theorygraph decompositions

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)

Abstract: For each $rge4$, we show that any graph $G$ with minimum degree at least $(1-1/100r)|G|$ has a fractional $K_r$-decomposition. This improves the best previous bounds on the minimum degree required to guarantee a fractional $K_r$-decomposition given by Dukes (for small $r$) and Barber, K"uhn, Lo, Montgomery and Osthus (for large $r$), giving the first bound that is tight up to the constant multiple of $r$ (seen, for example, by considering Tur'an graphs). In combination with work by Glock, K"uhn, Lo, Montgomery and Osthus, this shows that, for any graph $F$ with chromatic number $chi(F)ge4$, and any $varepsilon>0$, any sufficiently large graph $G$ with minimum degree at least $(1-1/100chi(F)+varepsilon)|G|$ has, subject to some further simple necessary divisibility conditions, an (exact) $F$-decomposition.

Recommendations

• Fractional clique decompositions of dense graphs and hypergraphs
• Fractional clique decompositions of dense partite graphs
• Fractional triangle decompositions in graphs with large minimum degree
• Asymptotically optimal K_k-packings of dense graphs via fractional K_k-decompositions
• On the decomposition threshold of a given graph

Cited in

(11)

• Fractional triangle decompositions of dense 3-partite graphs
• Progress towards Nash-Williams' conjecture on triangle decompositions
• On the decomposition threshold of a given graph
• Fractional clique decompositions of dense graphs and hypergraphs
• Asymptotically optimal K_k-packings of dense graphs via fractional K_k-decompositions
• Coloured and directed designs
• Fractional triangle decompositions in graphs with large minimum degree
• Vector clique decompositions
• Fractional clique decompositions of dense partite graphs
• Fractional clique decompositions of dense hypergraphs
• Maximal sets of mutually orthogonal frequency squares and Doehlert-Klee designs

This page was built for publication: Fractional clique decompositions of dense graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5229342)