Author of the publication

An Approximate Version of the Tree Packing Conjecture via Random Embeddings.

, , , and . APPROX-RANDOM, volume 28 of LIPIcs, page 490-499. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Approximating fractionally isomorphic graphons., and . Eur. J. Comb., (October 2023)An Approximate Version of the Tree Packing Conjecture via Random Embeddings., , , and . APPROX-RANDOM, volume 28 of LIPIcs, page 490-499. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Counting flags in triangle-free digraphs., , and . Electron. Notes Discret. Math., (2009)Chromatic roots and limits of dense graphs., , , and . Discret. Math., 340 (5): 1129-1135 (2017)Independent sets, cliques, and colorings in graphons., and . Eur. J. Comb., (2020)First steps in combinatorial optimization on graphons: Matchings., , , and . Electron. Notes Discret. Math., (2017)