Fractional clique decompositions of dense graphs and hypergraphs. arXiv preprint, 2015. ,
Edge-decompositions of graphs with high minimum degree. arXiv preprint arXiv:1410, 2014. ,
Rational decomposition of dense hypergraphs and some related eigenvalue estimates, Linear Algebra and its Applications, vol.436, issue.9, pp.3736-3746, 2012. ,
DOI : 10.1016/j.laa.2012.01.014
Rational decomposition of dense hypergraphs and some related eigenvalue estimates, Linear Algebra and its Applications, vol.436, issue.9, pp.3736-3746267, 2012. ,
DOI : 10.1016/j.laa.2012.01.014
Linear methods for rational triangle decompositions, 2014. ,
Decompositions of large graphs and digraphs with high minimum degree, 1991. ,
The existence of designs. arXiv preprint, 2014. ,
On a problem in combinatorics, Cambridge Dublin Mathematical Journal, vol.2, pp.191-204, 1847. ,
An unsolved problem concerning decomposition of graphs into triangles. Combinatorial Theory and its Applications III, pp.1179-1183, 1970. ,
Decomposition of complete graphs into subgraphs isomorphic to a given graph, Congressus Numerantium XV, pp.647-659, 1975. ,
The decomposition threshold for bipartite graphs with minimum degree one. Random Structures & Algorithms, pp.121-134, 2002. ,
Asymptotically optimal <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math>-packings of dense graphs via fractional <mml:math altimg="si2.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math>-decompositions, Journal of Combinatorial Theory, Series B, vol.95, issue.1, pp.1-11, 2005. ,
DOI : 10.1016/j.jctb.2005.02.002